{'fraction_non_alphanumeric': 0.03488372093023256, 'fraction_numerical': 0.001937984496124031, 'mean_word_length': 4.275510204081633, '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 the Modular Erdös-Burgess Constant

Let n be a positive integer. For any integer a, we say that is idempotent modulo n if a2≡a(mod n). The n-modular Erdos-Burgess constant is the smallest positive integer l such that any l integers contain one or more integers, whose product is idempotent modulo n. We gave a sharp lower bound of the n-modular Erdos-Burgess constant, in particular, we determined the n-modular Erdos-Burgess constant in the case when n was a prime power or a product of pairwise distinct primes.