ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(x)=c0+c1x+⋯+cdxd∈Z[x]f(x)=c_0+c_1x+\cdots+c_dx^d \in \mathbb{Z}[x] be a polynomial of degree d≥1d\ge 1 satisfying:

  1. cd>0c_d>0; 2. ff is irreducible over Q\mathbb{Q}; 3. gcd⁡{f(n)}n≥1=1\gcd\{f(n)\}_{n\ge 1}=1, i.e. the values f(1),f(2),f(3),…f(1),f(2),f(3),\dots have no common divisor larger than 11.

Then the set { n∈Z≥1:f(n) is prime }\{\,n\in\mathbb{Z}_{\ge 1}: f(n) \text{ is prime}\,\} is infinite.

(Here a prime is a positive prime; note that for any such ff one has gcd⁡{f(n)}n≥1=gcd⁡(f(m),f(m+1),…,f(m+d))\gcd\{f(n)\}_{n\ge 1}=\gcd\bigl(f(m),f(m+1),\dots,f(m+d)\bigr) for every integer mm, so condition 3 can be tested on any d+1d+1 consecutive integer arguments.)

In particular, taking f(x)=x2+1f(x)=x^2+1: there are infinitely many positive integers nn such that n2+1n^2+1 is prime; and taking f=Φkf=\Phi_k, the kk-th cyclotomic polynomial, for each k≥1k\ge 1 there are infinitely many positive integers nn such that Φk(n)\Phi_k(n) is prime.

Record

Added
Links

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.