Erdős Problem #376 — Central binomial coefficients coprime to 105
For a positive integer , let be the central binomial coefficient, and let denote the greatest common divisor of integers and . Is the set
infinite? Erdős Problems #376 On a conjecture of Graham on the p-divisibility of central binomial coefficients (2022 preprint)
Background
Known as Graham's problem, the question has a useful digit interpretation. Kummer's theorem identifies the exponent of a prime in with the number of carries when adding to itself in base . Thus exactly when every base- digit of is less than . For the three primes in the question, this requires digits only from in base , from in base , and from in base . Erdős Problems #376 On a conjecture of Graham on the p-divisibility of central binomial coefficients (2022 preprint)
Pomerance's heuristic treats these three digit restrictions as independent for a random integer up to . The estimated probabilities are approximately , , and , respectively, suggesting roughly simultaneous solutions up to . This is a heuristic based on an independence assumption, not a proof of infinitude. On a conjecture of Graham on the p-divisibility of central binomial coefficients (2022 preprint)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.