Amdeberhan–Moll divisibility conjecture for binomial coefficients

About 12 years old · traced to

Let a,ba,b and nn be positive integers with a>ba>b. For integers xx and yy, write x∣yx\mid y when xx divides yy. Amdeberhan–Moll's divisibility conjecture.

(2bn+1)(2bn+3)(2bnbn)∣3(a−b)(3a−b)(2anan)(anbn).(2bn+1)(2bn+3)\binom{2bn}{bn}\mid 3(a-b)(3a-b)\binom{2an}{an}\binom{an}{bn}.

The conjecture concerns divisibility properties of products of binomial coefficients. It is stated here as a conjecture of T. Amdeberhan and V. H. Moll and is proved in the paper, so its status is solved.

References

Primary source

Quan-Hui Yang, “Proof of a conjecture related to divisibility properties of binomial coefficients”, arXiv:1401.1108 (2014).

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.