Hardy–Ramanujan theorem

Hardy–Ramanujan theorem In mathematics, the Hardy–Ramanujan theorem, proved by G. H. Hardy and Srinivasa Ramanujan (1917), states that the normal order of the number ω(n) of distinct prime factors of a number n is log(log(n)).

Roughly speaking, this means that most numbers have about this number of distinct prime factors.

Contents 1 Precise statement 2 History 3 Generalizations 4 References Precise statement A more precise version states that for every real-valued function ψ(n) that tends to infinity as n tends to infinity {displaystyle |omega (n)-log log n|

Si quieres conocer otros artículos parecidos a Hardy–Ramanujan theorem puedes visitar la categoría Theorems about prime numbers.

Deja una respuesta

Tu dirección de correo electrónico no será publicada.


Utilizamos cookies propias y de terceros para mejorar la experiencia de usuario Más información