Divergence of the sum of the reciprocals of the primes
Theorem / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Divergence of the sum of the reciprocals of the primes?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
The sum of the reciprocals of all prime numbers diverges; that is:
This article uses technical mathematical notation for logarithms. All instances of log(x) without a subscript base should be interpreted as a natural logarithm, commonly notated as ln(x) or loge(x).
This was proved by Leonhard Euler in 1737,[1] and strengthens Euclid's 3rd-century-BC result that there are infinitely many prime numbers and Nicole Oresme's 14th-century proof of the divergence of the sum of the reciprocals of the integers (harmonic series).
There are a variety of proofs of Euler's result, including a lower bound for the partial sums stating that
for all natural numbers n. The double natural logarithm (log log) indicates that the divergence might be very slow, which is indeed the case. See Meissel–Mertens constant.