ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For m⩾2m\geqslant 2, write the polynomial cm(c1)c_m(c_1) as

cm(c1)=∑j=0rmpm,jc1j,c_m(c_1)=\sum_{j=0}^{r_m}p_{m,j}c_1^j,

where rmr_m is defined by the paper's equation for the structure of cm(c1)c_m(c_1). Let the greatest common divisor of its coefficients be

g.c.d.⁡ cm(c1):=g.c.d.⁡{pm,0,pm,1,…,pm,rm}.\operatorname{g.c.d.}\,c_m(c_1):=\operatorname{g.c.d.}\{p_{m,0},p_{m,1},\ldots,p_{m,r_m}\}.

Here zm⩾1z_m\geqslant1 is an integer sequence.

GCD power-of-two conjecture. For every m⩾2m\geqslant2,

g.c.d.⁡ cm(c1)=2zm.\operatorname{g.c.d.}\,c_m(c_1)=2^{z_m}.

The paper notes that divisibility by 22 for all m⩾2m\geqslant2 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 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.