ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let fn(x)f_n(x) be the polynomial sequence defined earlier in the paper, and let aa be a positive integer. Prime-value conjecture. For every positive integer aa, there are infinitely many n∈Nn\in\mathbb{N} such that ∣fn(a)∣|f_n(a)| is a prime number. If true, this would show that the condition on the exponent of pp in the second part of the paper's cited theorem cannot be dropped. The assertion is presented as an open conjecture and is distinct from the irreducibility conjecture, since it fixes aa and varies nn.

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.