ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Are there infin- itely many integers n such that P (n) is a prime number? On the largest prime factor of quartic polynomial values: the cyclic and dihedral cases Cécile Dartyge (joint work with James Maynard) The best general result was obtained by Tenenbaum [6] who proved that if f (X) \in Z[X] is irreducible with degree \geq 2 then for \alpha \in]0, 2 − log 4[, Y P+ f (n) \geq x exp((log x)\alpha ), (x \geq x0 (\alpha, f )). n\leqx

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.