Bunyakovsky conjecture
Statement
Let be a polynomial of degree satisfying:
- ; 2. is irreducible over ; 3. , i.e. the values have no common divisor larger than .
Then the set is infinite.
(Here a prime is a positive prime; note that for any such one has for every integer , so condition 3 can be tested on any consecutive integer arguments.)
In particular, taking : there are infinitely many positive integers such that is prime; and taking , the -th cyclotomic polynomial, for each there are infinitely many positive integers such that is prime.
Record
- Added
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.