← All problems

Bunyakovsky's conjecture on prime values of polynomials

11 years old · traced to

Let

f(x)=∑j=0dajxj∈Z[x]f(x)=\sum_{j=0}^{d}a_jx^j\in\mathbb{Z}[x]

be an irreducible polynomial with positive leading coefficient and satisfying gcd(a1,…,ad)=1\mathrm{gcd}(a_1,\ldots,a_d)=1.

Bunyakovsky's conjecture. The value f(n)f(n) should be prime for infinitely many positive integers nn.

This is a classical conjecture on prime values of irreducible polynomials and would, for example, imply the existence of infinitely many repunit primes with a fixed number of digits in the applications discussed in the paper. It remains open in general.

References

7 papers in this index state this conjecture (2015–2026). The statement above is taken from the most recent of them; the others are arXiv:2410.00177, arXiv:2405.03552, arXiv:2311.15922, arXiv:2308.10216, arXiv:1805.08851, arXiv:1507.05080.

Source: Jorge Jiménez Urroz and Alexander Moretó, “The number of Sylow subgroups and a generalization of Mersenne primes”, arXiv:2606.24688 (2026).

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.