{'fraction_non_alphanumeric': 0.03368421052631579, 'fraction_numerical': 0.008421052631578947, 'mean_word_length': 4.734939759036145, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, '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}}
On Factoring Jevons' Number

In the 1870's, W.S. Jevons anticipated a key feature of the RSA algorithm for public key cryptography, namely that multiplication of integers is easy, but finding the prime factors of the product is hard. He presented a specific ten-digit number whose prime factorization, he believed, would forever remain unknown except to himself. In this paper, it is shown that Jevons' number could have been factored relatively easily, even in his own time.