ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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.