GCD power-of-two conjecture for the coefficients of c_m(c_1)
Statement
For , write the polynomial as
where is defined by the paper's equation for the structure of . Let the greatest common divisor of its coefficients be
Here is an integer sequence.
GCD power-of-two conjecture. For every ,
The paper notes that divisibility by for all follows from the recurrence relation, while the asserted exact power-of-two form is suggested by computer calculations.
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.