← All problems

Erdős Problem #396 — Consecutive products dividing central binomial coefficients

46 years old · traced to

For each integer k≥0k\ge 0, does there exist an integer n>kn>k such that the product of the k+1k+1 consecutive positive integers ending at nn divides the central binomial coefficient?

∏i=0k(n−i)  ∣  (2nn).\prod_{i=0}^{k}(n-i)\;\Bigm|\;\binom{2n}{n}.

Equivalently, for every prime pp must one be able to choose such an nn with

vp ⁣((2nn))≥∑i=0kvp(n−i),v_p\!\left(\binom{2n}{n}\right)\ge \sum_{i=0}^{k}v_p(n-i),

where vp(a)v_p(a) is the exponent of pp in the positive integer aa. 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 n+1n+1 always divides (2nn)\binom{2n}{n}: the quotient is the nnth Catalan number. The contrast is that divisibility by nn 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 pp, the exponent vp ⁣((2nn))v_p\!\left(\binom{2n}{n}\right) equals the number of carries when adding nn to itself in base pp. 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

Progress summary

Never refreshed

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.