Guo–Jouhet–Zeng gcd conjecture for alternating binomial sums
Statement
For positive integers and , define
Here denotes the greatest common divisor of the indicated integers. Guo–Jouhet–Zeng's gcd conjecture.
Calkin's congruence shows that divides every term in the gcd. The conjecture asserts that this common divisor is exact for every positive and ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.