Quadratic Primes

2014/01/06 by N. A. Carella, Carella, N. A.
Mathematics · #11A41 #11N13 #11N32 #Analytic Number Theory Research #FOS: Mathematics #General Mathematics (math.GM) #History and Theory of Mathematics #Mathematics and Applications

paper · pdf · doi:10.48550/arxiv.1401.2355

openalex publication_date 2014/01/06 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28

Abstract

The subset of quadratic primes p = an² + bn + c : n => 1 generated by an irreducible polynomial f(x) = ax² + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a possible proof for some of these quadratic polynomials. In particular, it is shown that the cardinality of the simplest subset of quadratic primes p = n² + 1 : n => 1 is infinite.

Related

• Almost-Primes Represented by Quadratic Polynomials
• Primes In Cubic Arithmetic Progressions
• Prime Values of Quadratic Polynomials
• On the largest prime factor of quadratic polynomials
• On the greatest prime factor and uniform equidistribution of quadratic polynomials