Bouniakowsky's conjecture on prime values of irreducible polynomials
Statement
Let be a polynomial with integer coefficients. Assume that its leading coefficient is positive, that is irreducible over the integers, and that
Bouniakowsky's conjecture. Then is prime for infinitely many positive integer values of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.