Prime values of n2+1n^2+1 conjecture

About 5 years old · traced to

Let

C+=2∏p>2(1−(−1p)(p−1)2)=1.3728134628…,C_+=2\prod_{p>2}\left(1-\frac{\left(\frac{-1}{p}\right)}{(p-1)^2}\right)=1.3728134628\ldots,

where (−1p)\left(\frac{-1}{p}\right) is the Legendre symbol. n2+1n^2+1 prime-value conjecture. The expected number of primes of the form n2+1n^2+1 less than or equal to NN is

C+2∫2Ndxlog⁡x∼C+Nlog⁡N.\frac{C_+}{2}\int_2^{\sqrt N}\frac{dx}{\log x}\sim C_+\frac{\sqrt N}{\log N}.

This is the local-density heuristic for the quadratic polynomial n2+1n^2+1; it remains open.

References

Primary source

Chris K. Caldwell, “An Amazing Prime Heuristic”, arXiv:2103.04483 (2021).

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.