{'fraction_non_alphanumeric': 0.045743329097839895, 'fraction_numerical': 0.008894536213468869, 'mean_word_length': 4.150326797385621, '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}}
TIGHT INSTANCES OF THE LONELY RUNNER

The Lonely Runner Conjecture of J. Wills asserts the following. For any vector v ∈ (R−{0})n−1 there exists t ∈ R such that every component of tv has distance at least 1/n to the nearest integer. We study those vectors v for which the bound of this conjecture is attained. In particular, we construct an infinite family of such tight vectors. This family, plus three sporadic examples, constitute all known tight vectors. We completely characterize a subfamily: those tight vectors obtained from v = 〈1, 2, . . . , n − 1〉 by scaling one entry by a positive integer. The characterization motivates the problem of finding the least positive integer which has a common factor with every integer in the interval [a, b]. We solve this problem when b ≥ 2a.