ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(n)f(n) be a polynomial with integer coefficients. Assume that its leading coefficient is positive, that ff is irreducible over the integers, and that

gcd⁡(f(1),f(2),f(3),…)=1.\gcd(f(1),f(2),f(3),\ldots)=1.

Bouniakowsky's conjecture. Then f(n)f(n) is prime for infinitely many positive integer values of nn. This is the motivating conjecture for studying eventually prime-free sequences, since reducible or fixed-divisor obstructions can prevent a polynomial sequence from taking prime values infinitely often.

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.