Primes In Cubic Arithmetic Progressions
Abstract
This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes p = n3 + 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.
0