<commit_before>===========================
Mathematics and engineering
===========================
------------------------------------
A pithy footnote from SICP :: quotes
------------------------------------

.. image:: /static/images/bookcovers/9780262510875.jpg
   :align: right

`Structure and Interpretation of Computer Programs`_ is full of interesting
footnotes.  Here's a good one about the Fermat test for prime numbers:

.. _`Structure and Interpretation of Computer Programs`: http://en.wikipedia.org/wiki/Structure_and_Interpretation_of_Computer_Programs 

    Numbers that fool the Fermat test are called *Carmichael numbers*, and
    little is known about them other than that they are extremely rare.  There
    255 Carmichael below 100,000,000.  The smallest few are 561, 1105, 1729,
    2465, 2821 and 6601.  In testing primality of very large numbers chosen at
    random, the chance of stumbling upon a value that fools the Fermat test is
    less than the chance that cosmic radiation will cause the computer to make
    an error in carrying out a correct algorithm.  Considering an algorithm to
    be inadequate for the first reason but not for the second illustrates the
    difference between mathematics and engineering.<commit_msg>Amends to SICP article<commit_after>===========================
Mathematics and engineering
===========================
------------------------------------
A pithy footnote from SICP :: quotes
------------------------------------

.. image:: /static/images/bookcovers/9780262510875.jpg
   :align: right

`Structure and Interpretation of Computer Programs`_ is full of interesting
footnotes.  Here's a good one about the Fermat test for prime numbers:

.. _`Structure and Interpretation of Computer Programs`: http://en.wikipedia.org/wiki/Structure_and_Interpretation_of_Computer_Programs 

    Numbers that fool the Fermat test are called *Carmichael numbers*, and
    little is known about them other than that they are extremely rare.  There
    255 Carmichael below 100,000,000.  The smallest few are 561, 1105, 1729,
    2465, 2821 and 6601.  In testing primality of very large numbers chosen at
    random, the chance of stumbling upon a value that fools the Fermat test is
    less than the chance that cosmic radiation will cause the computer to make
    an error in carrying out a correct algorithm.  Considering an algorithm to
    be inadequate for the first reason but not for the second illustrates the
    difference between mathematics and engineering.

Taken from page 53.
{'fraction_non_alphanumeric': 0.1370777690494894, 'fraction_numerical': 0.0384917517674784, 'mean_word_length': 3.245, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5923291', 'n_tokens_mistral': 708, 'n_tokens_neox': 589, 'n_words': 302}