Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Ottawa

$19,000.00

Moments of primes in arithmetic progressions

FY 2017-18

Summary
My research project is concerned with the distribution of primes in arithmetic progressions, that is primes of the form p=qn+a, with a and q two coprime integers which are determined in advance. The distribution of prime numbers is a central question in number theory, and has many applications.  Perhaps the most omnipresent practical application of prime numbers is the RSA cryptography algorithm, which is used every time a credit card transaction is being processed on the internet. See for example the nice Slate article http://www.slate.com/articles/health_and_science/science/2013/06/online_credit_card_security_the_rsa_algorithm_prime_numbers_and_pierre_fermat.html.  On a more theoretical note, the understanding of primes in arithmetic progressions constitutes a fundamental step in many other number theoretical problems, such as for example the revolutionary theorems of Zhang, Maynard and Tao which imply that there are infinitely many pairs of primes which differ by at most 246.  My main goal is to understand several statistics (chiefly moments) of the distribution of primes p=qn+a up to a given limit x. The knowledge of all moments is usually sufficient to uniquely determine a distribution. However, the first two moments, the mean and variance, already give a good understanding of a distribution, and imply certain ""almost everywhere"" statements. These two moments have been extensively studied in the literature by many well-known mathematicians. For instance, Hooley devoted more than fifteen research papers on questions related to the variance. For the first moment, I plan to extend the results of my thesis to different arithmetical contexts, and to introduce Vaughan's approximation in order to obtain more precise results. The range where this last approximation works best is precisely the range where my thesis results apply, and it is clear that sharp results will follow from combining the techniques I used with this approximation. Vaughan introduced his approximation in a paper where he studied the variance of primes in arithmetic progressions. I plan to revise his analysis and to hopefully sharpen his results , by using an alternative technique. As for higher moments, I plan to apply probabilistic arguments using the explicit formula, as was already done with the variance in my previous work.  The different techniques I will use are quite complementary in that they apply to very different ranges. Probabilistic arguments on explicit formulas work for very small moduli, zero-statistic arguments with the help of random matrix theory work for intermediate moduli, and divisor-switching techniques work for large moduli. The combination of all these techniques should allow for a better understanding of the distribution of primes in arithmetic progressions.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2015-05955
Name nom
Fiorilli, Daniel
Department département
Mathematics and Statistics - Mathématiques et statistiques
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2015
Award amount
19000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2913
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Number theory
Research subject fr
Théorie des nombres
Partie
3
Nb partie
5
Application title
Moments of primes in arithmetic progressions
Keyword
NSERC
Application summary
My research project is concerned with the distribution of primes in arithmetic progressions, that is primes of the form p=qn+a, with a and q two coprime integers which are determined in advance. The distribution of prime numbers is a central question in number theory, and has many applications.  Perhaps the most omnipresent practical application of prime numbers is the RSA cryptography algorithm, which is used every time a credit card transaction is being processed on the internet. See for example the nice Slate article http://www.slate.com/articles/health_and_science/science/2013/06/online_credit_card_security_the_rsa_algorithm_prime_numbers_and_pierre_fermat.html.  On a more theoretical note, the understanding of primes in arithmetic progressions constitutes a fundamental step in many other number theoretical problems, such as for example the revolutionary theorems of Zhang, Maynard and Tao which imply that there are infinitely many pairs of primes which differ by at most 246.  My main goal is to understand several statistics (chiefly moments) of the distribution of primes p=qn+a up to a given limit x. The knowledge of all moments is usually sufficient to uniquely determine a distribution. However, the first two moments, the mean and variance, already give a good understanding of a distribution, and imply certain ""almost everywhere"" statements. These two moments have been extensively studied in the literature by many well-known mathematicians. For instance, Hooley devoted more than fifteen research papers on questions related to the variance. For the first moment, I plan to extend the results of my thesis to different arithmetical contexts, and to introduce Vaughan's approximation in order to obtain more precise results. The range where this last approximation works best is precisely the range where my thesis results apply, and it is clear that sharp results will follow from combining the techniques I used with this approximation. Vaughan introduced his approximation in a paper where he studied the variance of primes in arithmetic progressions. I plan to revise his analysis and to hopefully sharpen his results , by using an alternative technique. As for higher moments, I plan to apply probabilistic arguments using the explicit formula, as was already done with the variance in my previous work.  The different techniques I will use are quite complementary in that they apply to very different ranges. Probabilistic arguments on explicit formulas work for very small moduli, zero-statistic arguments with the help of random matrix theory work for intermediate moduli, and divisor-switching techniques work for large moduli. The combination of all these techniques should allow for a better understanding of the distribution of primes in arithmetic progressions.