Prime Values of the Euler Polynomial

2019/12/11 by Carella, N. A.
#FOS: Mathematics #General Mathematics (math.GM) #Primary 11N322 #Secondary 11N05

paper · doi:10.48550/arxiv.1912.05923

Abstract

This note provides an effective lower bound for the number of primes in the quadratic progression p=n²+1 ≤ x as x → ∞.

Related

• A 60,000 digit prime number of the form x² + x + 41
• Prime Values of Quadratic Polynomials
• There are infinitely many prime numbers in all arithmetic progressions with first term and difference coprime
• When Euler met Brun
• Counting integers with a smooth totient