ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers mm and nn, define

Ar(n)=∑k=02n(−1)k(2nk)r.A_r(n)=\sum_{k=0}^{2n}(-1)^k\binom{2n}{k}^r.

Here gcd⁡(a1,a2,…)\gcd(a_1,a_2,\ldots) denotes the greatest common divisor of the indicated integers. Guo–Jouhet–Zeng's gcd conjecture.

gcd⁡(Am(n),Am+1(n),Am+2(n),…)=(2nn).\gcd\bigl(A_m(n),A_{m+1}(n),A_{m+2}(n),\ldots\bigr)=\binom{2n}{n}.

Calkin's congruence shows that (2nn)\binom{2n}{n} divides every term in the gcd. The conjecture asserts that this common divisor is exact for every positive mm and nn; the supplied source does not indicate a 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.