The binomial alternating-sum gcd conjecture
Statement
For positive integers and , define the sequence of integers
The alternating-sum gcd conjecture. For all positive and ,
Here the greatest common divisor is taken over all exponents . This is presented as one of the paper’s open problems, and no general proof or disproof is supplied.
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.