{'fraction_non_alphanumeric': 0.10831234256926953, 'fraction_numerical': 0.010075566750629723, 'mean_word_length': 4.1688311688311686, '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}}
Small solutions of quadratic congruences

Let Q(x) = Q(x1, …, xn)∈ℤ[x1, …, xn] be a quadratic form. We investigate the size of the smallest non-zero solution of the congruence Q(x)≡0 (mod q). We seek a bound Bn(q), independent of Q, such that there is always a non-zero solution satisfying The form gives the trivial lower bound Bn(q)≥(q/n)½ for all q and n, since if x≠0 and q∣ Q(x), then Q(x)≥q.