The quadratic-prime conjecture for n2+1n^2+1

Let f(n)=n2+1f(n)=n^2+1, and define its weighted prime-value counting function by

S2(x)=n2+1xΛ(n2+1).S_2(x)=\sum_{n^2+1\leq x}\Lambda(n^2+1).

Quadratic-prime conjecture. There are infinitely many primes of the form p=n2+1p=n^2+1, and

S2(x)=s2x1/2+O(x1/2logx).S_2(x)=s_2x^{1/2}+O\left(\frac{x^{1/2}}{\log x}\right).

This is a special case of the prime-values heuristic and is open; in particular, infinitude of primes represented by n2+1n^2+1 is not known.

Sources & referencesView supporting material

Primary source

N. A. Carella, “Asymptotic For Primitive Roots Producing Polynomials”, arXiv:1609.01147 (2017).

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.