The central binomial coefficient divisibility conjecture

From papers

Let nn be an integer greater than 44, and consider the central binomial coefficient (2nn)\binom{2n}{n}. Divisibility conjecture. The central binomial coefficient (2nn)\binom{2n}{n} is divisible by 44 or 99 for every n>4n>4 except n=64n=64 and n=256n=256. This is the paper's starting problem; the abstract describes the corresponding assertion for n>256n>256 as open, and the paper does not provide a definite answer.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Sebastian Tim Holdum, Frederik Ravn Klausen and Peter Michael Reichstein Rasmussen, “Powers in prime bases and a problem on central binomial coefficients”, arXiv:2601.09510 (2026).

Solutions 0

No solutions have been posted yet.