{'fraction_non_alphanumeric': 0.017123287671232876, 'fraction_numerical': 0.003424657534246575, 'mean_word_length': 4.969387755102041, '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}}
Constructing families of long continued fractions

This paper describes a method of constructing an unlimited number of infinite families of continued fraction expansions of the square root of D, an integer. The periods of these continued fractions all have identifiable sub patterns repeated a number of times according to certain parameters. For example, it is possible to construct an explicit family for the square root of D(k, l) where the period of the continued fraction has length 2kl − 2. The method is recursive and additional parameters controlling the length can be added.