Erdős Problem #396 — Consecutive products dividing central binomial coefficients
For each integer , does there exist an integer such that the product of the consecutive positive integers ending at divides the central binomial coefficient?
Equivalently, for every prime must one be able to choose such an with
where is the exponent of in the positive integer . Erdős Problem #396
Background
The problem is listed in Erdős and Graham’s Old and New Problems and Results in Combinatorial Number Theory (1980). Its setting includes the familiar fact that always divides : the quotient is the th Catalan number. The contrast is that divisibility by is much less frequent, motivating questions about divisors close to the central index. Erdős Problem #396 Erdős and Graham (1980) Pomerance, Divisors of the Middle Binomial Coefficient (2015)
A useful local test comes from Kummer’s theorem: for each prime , the exponent equals the number of carries when adding to itself in base . Thus the question asks for enough prime-power divisibility in the central binomial coefficient to cover the full valuation of a product of consecutive integers; checking divisibility by each factor separately would not by itself verify divisibility by their product. Pomerance, Divisors of the Middle Binomial Coefficient (2015)
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.