The prime number theorem /
At first glance the prime numbers appear to be distributed in a very irregular way amongst the integers, but it is possible to produce a simple formula that tells us (in an approximate but well defined sense) how many primes we can expect to find that are less than any integer we might choose. The p...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | Jameson, G. J. O. (Graham James Oscar) |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Cambridge ; New York :
Cambridge University Press,
2003.
|
Colección: | London Mathematical Society student texts ;
53. |
Temas: | |
Acceso en línea: | Texto completo |
Ejemplares similares
-
Prime-detecting sieves /
por: Harman, G. (Glyn), 1956-
Publicado: (2007) -
Prime-Detecting Sieves (LMS-33) /
por: Harman, G. (Glyn), 1956-
Publicado: (2007) -
Closing the gap : the quest to understand prime numbers /
por: Neale, Vicky
Publicado: (2017) -
Primes of the form x² + ny² : Fermat, class field theory, and complex multiplication /
por: Cox, David A.
Publicado: (2013) -
Finite and infinite primes for rings and fields /
por: Harrison, David Kent, 1931-
Publicado: (1966)