Applying Discrete Fourier Transform to the Hardy-Littlewood Conjecture

preprint2016arXivOpen access

Abstract

We study the asymptotic behaviour of the prime pair counting function π2k(n)π_{2k}(n) by the means of the discrete Fourier transform on Z/nZ\mathbb{Z}/ n\mathbb{Z}. 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 R/Z\mathbb{R} /\mathbb{Z}, which is used in the circle method. We show how to recover the main term for π2k(n)π_{2k}(n) predicted by the Hardy-Littlewood Conjecture from the discrete Fourier series. The arguments rely on interplay of Fourier transforms on Z/nZ\mathbb{Z}/ n\mathbb{Z} and on its subgroup Z/QZ,\mathbb{Z}/ Q\mathbb{Z}, Q ∣ n.Q \, | \, n.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.