ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m∈Z+m\in\mathbb{Z}^+, let a1,…,am∈Za_1,\ldots,a_m\in\mathbb{Z}, let b1,…,bm,r∈Nb_1,\ldots,b_m,r\in\mathbb{N}, let n∈Z+n\in\mathbb{Z}^+, and let ε∈{±1}\varepsilon\in\{\pm1\}. Define the binomial coefficients in the usual generalized sense. Generalized binomial divisibility conjecture. Then

∑k=0n−1(−1)mkεk(2k+1)kr(k+1)r∏i=1m(ai−1bi+k)≡0(modgcd⁡(a1,…,am,b1,…,bm,n)).\sum_{k=0}^{n-1}(-1)^{mk}\varepsilon^k(2k+1)k^r(k+1)^r\prod_{i=1}^m{a_i-1\choose b_i+k}\equiv0\pmod{\gcd(a_1,\ldots,a_m,b_1,\ldots,b_m,n)}.

The claim extends divisibility congruences for products of binomial coefficients; the excerpt supplies no proof or resolution.

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.