arXiv · 1302.0772
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 = n^3 + 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.
Explore related subjects
Keep this discovery
N. A. Carella. 2013-02-04. Primes In Cubic Arithmetic Progressions. https://arxiv.org/abs/1302.0772
Cite the original work for its findings. Save a collection to share your selection of sources.