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

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris

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”

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus
19 pages
English
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus

Description

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


Sujets

Informations

Publié par
Nombre de lectures 14
Langue English

Extrait

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
  • Univers Univers
  • Ebooks Ebooks
  • Livres audio Livres audio
  • Presse Presse
  • Podcasts Podcasts
  • BD BD
  • Documents Documents