ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For the von Mangoldt function Λ, this encodes the fundamental question of when polynomials capture their primes. Bateman-Horn, Chowla and the integral Hasse principle for random polynomials Tim Browning (joint work with Efthymios Sofos, Joni Teräväinen) parameterising polynomials fc (t) = c0 td + \cdot \cdot \cdot + cd \in Z[t] with positive leading coefficient. Our first result shows that we typically obtain a polynomial lower bound on the number of prime values that a polynomial takes.

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.