Primes In Cubic Arithmetic Progressions

2013/02/04 by Carella, N. A.
#11A41 #11N05 #11N13 #11N32 #FOS: Mathematics #General Mathematics (math.GM)

paper · doi:10.48550/arxiv.1302.0772

Abstract

This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes p = n³ + 2 is prime : n => 1 is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes counting function is established.

Related

• Elementary Primes Counting Methods
• Squares in arithmetic progressions and infinitely many primes
• Problems on combinatorial properties of primes
• A Theorem on Prime Numbers
• Prescribing the binary digits of primes