Scribd Logo
Upload

Welcome to Scribd!

  • Prime Numbers Lec2

    Uploaded by

    book
    4 views4 pages
    This document discusses counting prime numbers and the development of the prime number theorem. It shows how the function π(N) represents the number of prime numbers less than or equal to N. Legendre and Gauss conjectured that π(N) increases like N/log(N) as N approaches infinity. This was proved as the prime number theorem in 1896 independently by Hadamard and de la Vallée-Poussin, using complex analysis of the Riemann zeta function. The prime number theorem is now generalized in many directions through density theorems on prime numbers.

    Original Description:

    Prime Numbers

    Original Title

    Prime Numbers lec2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses counting prime numbers and the development of the prime number theorem. It shows how the function π(N) represents the number of prime numbers less than or equal to N. Legendre and Gauss conjectured that π(N) increases like N/log(N) as N approaches infinity. This was proved as the prime number theorem in 1896 independently by Hadamard and de la Vallée-Poussin, using complex analysis of the Riemann zeta function. The prime number theorem is now generalized in many directions through density theorems on prime numbers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views4 pages

    Prime Numbers Lec2

    Uploaded by

    book
    This document discusses counting prime numbers and the development of the prime number theorem. It shows how the function π(N) represents the number of prime numbers less than or equal to N. Legendre and Gauss conjectured that π(N) increases like N/log(N) as N approaches infinity. This was proved as the prime number theorem in 1896 independently by Hadamard and de la Vallée-Poussin, using complex analysis of the Riemann zeta function. The prime number theorem is now generalized in many directions through density theorems on prime numbers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    Question Can we count prime numbers?

    π(N) = the number of prime numbers P


    with P ≤ N
    π(10) = 4 (2, 3, 5, 7)
    π(100) = 25 (2, 3, 5, 7,…, 97)
    π(1000) = 168
    π(10000) = 1229
    π(N) = ???
    π(N) ≑ N/log(N) ?

    Adrien-Marie Carl Friedrich


    Legendre Gauss
    (1752-1833) (1777-1855)
    https://en.wikipedia.org/wiki/Prime-counting_function
    https://en.wikipedia.org/wiki/Adrien-Marie_Legendre
    https://en.wikipedia.org/wiki/Carl_Friedrich_Gauss
    Prime Number Theorem (1896)
    As N→∞, π(N) increases like N/log(N).

    Jacques Salomon Charles Jean


    Hadamard de la Vallée-Poussin
    (1865-1963) (1866-1962)

    https://en.wikipedia.org/wiki/Jacques_Hadamard
    https://en.wikipedia.org/wiki/Charles_Jean_de_la_Vall%C3%A9e-Poussin
     The proof of PNT is complex analytic.
    It requires detailed analysis of
    the Riemann zeta function.

     Today, PNT is successfully generalized to


    many directions (Density Theorems on
    prime numbers).

    You might also like