2000 character limit reached
Spectral Methods And Prime Numbers Counting Problems
Published 26 Aug 2015 in math.GM | (1509.00457v8)
Abstract: A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more general dePolignac conjecture on the existence of infinitely many primes pairs p and p + 2k, k => 1, is proposed in this note.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.