On the prime number lemma of Selberg | Zendy

Filip Saidak | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the prime number lemma of Selberg

Author(s) -

Filip Saidak

Publication year - 2008

Publication title -

mathematica scandinavica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.553

H-Index - 30

eISSN - 1903-1807

pISSN - 0025-5521

DOI - 10.7146/math.scand.a-15065

Subject(s) - lemma (botany) , mathematics , mathematical proof , prime (order theory) , prime number theorem , multiplicative number theory , prime number , discrete mathematics , algebra over a field , pure mathematics , prime factor , combinatorics , ecology , geometry , poaceae , biology

The key result needed in almost all elementary proofs of the Prime Number Theorem is a prime number lemma proved by Atle Selberg in 1948. Without restricting ourselves to purely elementary techniques we show how the error term in Selberg's fundamental lemma relates to the error term in the Prime Number Theorem. In spite of all the interest in this topic over the last sixty years this particular question seems to have been overlooked in the past.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research