ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.