Quadratic Primes
Abstract
The subset of quadratic primes p = an2 + bn + c : n => 1 generated by an irreducible polynomial f(x) = ax2 + 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 = n2 + 1 : n => 1 is infinite.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.