//img.uscri.be/pth/bbdf35482ec2ebeed0414338247fb0b286987809
Cet ouvrage fait partie de la bibliothèque YouScribe
Obtenez un accès à la bibliothèque pour le lire en ligne
En savoir plus

We prove that the number of primes in an interval of length N is at most 2N Log N when N is large enough This is obtained through a sieving process which can be seen as a hybrid between the large sieve and the Selberg sieve and draws on what we call ”local models”

19 pages
Abstract We prove that the number of primes in an interval of length N is at most 2N/(Log N +3.53) when N is large enough. This is obtained through a sieving process which can be seen as a hybrid between the large sieve and the Selberg sieve, and draws on what we call ”local models”. 1

  • ???i ?2

  • j?i? n2j

  • ?f?2 ?

  • brun-titchmarsh

  • lemma reads

  • gershgorin disc

  • lemma

  • negative real

  • readily follows

  • indeed


Voir plus Voir moins
Abstract
We prove that the number of primes in an interval of length N is at most 2 N (Log N + 3 53) when N is large enough. This is obtained through a sieving process which can be seen as a hybrid between the large sieve and the Selberg sieve, and draws on what we call ”local models”.
1