Bateman–Horn conjecture for admissible irreducible integer polynomials

Let f1,,fkf_1,\ldots,f_k be irreducible integer polynomials satisfying the admissibility condition. Let P(x)P(x) denote the number of integers nxn\leq x for which all fi(n)f_i(n) are prime. Bateman–Horn conjecture. The count is asymptotically

P(x)Cdegfi2xdt(logt)k,P(x)\sim \frac{C}{\prod \deg f_i}\int_2^x\frac{dt}{(\log t)^k},

where CC is a product over primes adjusted for local obstructions. This conjecture predicts the density of simultaneous prime values of admissible polynomial families and underlies the paper’s discussion of prime-rich polynomials; it remains open in general.

Sources & referencesView supporting material

Primary source

Sudarshan Kumaresan, Shipra Kumari and Neha Mishra, “Redefining Euler-Rabinowitsch Polynomials with Heegner Number Based Quadratic Formulation”, arXiv:2508.02821 (2025).

Additional references

11 papers in this index state this conjecture (2008–2025). The statement above is taken from the most recent of them; the others are arXiv:2312.11445, arXiv:2205.07650, arXiv:2105.03915, arXiv:2005.11835, arXiv:1906.03370, arXiv:1801.03082, arXiv:1609.01147, arXiv:1310.5198, arXiv:0902.4352, arXiv:0806.1667.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.