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”

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

English

Documents

Lire un extrait

Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

Découvre YouScribe et accède à tout notre catalogue !

Découvre YouScribe et accède à tout notre catalogue !

19

pages

English

Documents

Lire un extrait

Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

Publié par

profil-urra-2012

Nombre de lectures

16

Langue

English

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

Publié par

profil-urra-2012

Langue

English

Christoph Theorem Gershgorin circle theorem Indeed.com

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