Abstract
We study the asymptotic behaviour of the prime pair counting function by the means of the discrete Fourier transform on . The method we develop can be viewed as a discrete analog of the Hardy-Littlewood circle method. We discuss some advantages this has over the Fourier series on , which is used in the circle method. We show how to recover the main term for predicted by the Hardy-Littlewood Conjecture from the discrete Fourier series. The arguments rely on interplay of Fourier transforms on and on its subgroup
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.