Jones's polynomial Cunningham-chain reducibility conjecture

At least 14 years old · documented by

Let k≥1k\geq 1 be an integer, and define

t=2⌈k+12⌉+1,t=2\left\lceil\frac{k+1}{2}\right\rceil+1, m=2(2t+13).m=2\left(\frac{2^t+1}{3}\right).

For an integer j≥t−kj\geq t-k, consider the polynomial

xj+xj−1+⋯+x+m.x^j+x^{j-1}+\cdots+x+m.

Jones's polynomial Cunningham-chain reducibility conjecture. The polynomial is reducible over Q\mathbb{Q} if and only if j=tj=t. This conjecture proposes an explicit family of initial polynomials whose associated polynomial Cunningham chains have a prescribed reducibility pattern; the supplied text gives no resolution status.

References

Primary source

Lenny Jones, “Polynomial Cunningham Chains”, arXiv:1104.1579 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.