{'fraction_non_alphanumeric': 0.02027027027027027, 'fraction_numerical': 0.005067567567567568, 'mean_word_length': 4.02542372881356, 'pattern_counts': {'":': 0, '<': 1, '<?xml version=': 0, '>': 1, '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 a Constant Associated with the Prouhet-Tarry-Escott Problem

For n a positive integer, the Prouhet-Tarry-Escott Problem asks for two different sets of n positive integers for which the sum of the kth powers of the elements of one set is equal to the sum of the kth powers of the elements of the second set for each positive integer k < n. For n > 12, it is not known whether such sets exist. I will give some background on this problem and then show how Newton polygons can be used to determine information on the size of the 2-adic value of a certain constant associated with the problem.