New Proof That the Sum of the Reciprocals of Primes Diverges

In this paper, we give a new proof of the divergence of the sum of the reciprocals of primes using the number of distinct prime divisors of positive integer n, and the placement of lattice points on a hyperbola given by n=pr with prime number p. We also offer both a new expression of the average sum of the number of distinct prime divisors, and a new proof of its divergence, which is very intriguing by its elementary approach.


Introduction
It has sometimes been mentioned that number theory is the theory of prime numbers. There are infinitely many prime numbers, a theorem proved by Euclid (ca. 300 BCE), but it was also proved by other different methods by Christian Goldbach, Leonhard Euler, Charles Hermite, and Thomas J. Stieltjes from the 18th to the 19th century, and in the 20th and 21st centuries by Paul Erdős, Hillel Furstenberg, Filip Saidak, Juan P. Pinasco, Junho P. Whang, and Alexander Shen, among several dozen existing proofs [1].
Π(x), the prime-counting function, gives a number of primes less than or equal to x ∈ R. So, in terms of Π(x), Euclid's theorem on the infinitude of prime numbers can be expressed as lim x→+∞ Π(x) = +∞.
On the other hand, prime numbers show asymptotic distribution, formalizing that, as one progresses along the natural numbers, prime numbers are less common, something that we can simply express as lim x→+∞ Π(x) x log x = 1.
Leonhard Euler proved in 1737 [2] that the sum of the reciprocals of all prime numbers diverges: For this, he used the harmonic series, and the equality between it and its product formula after applying logarithms and using the equality of the Taylor series of log(1 − x).
Euler also noticed that the value of this sum had a correspondence to log log x, although he did not give a proof. Karl F. Gauss formulated the same result in [3].
In 1874, using some results of Pafnuti L. Chebyshev [4,5], Franz Mertens [6] found that log log x is the right order of magnitude, obtaining Here, M is the Meissel-Mertens constant, defined by equation where γ is the Euler-Mascheroni constant: Mertens' formula, although it was refined [7,8], is sufficient for our purposes here. Following the proofs of the divergence of the sum of the reciprocals of prime numbers, two further ones are those of Paul Erdős [9], which were developed by reductio ad absurdum; assuming a partial sum less than 1/2 (first proof) or 1/8 (second proof) from a certain prime p i to infinity, With similar elements, we indicate a third proof by Seki Shin-ichiro [10] in 2018, which uses the Euler-Legendre theorem ("there are no length-three arithmetic progressions whose terms are cubes of positive integers"), and Szemerédi's theorem ("let A be a set of positive integers that has positive upper density. Then, A contains an arithmetic progression of length k for every positive integer k"), proved for the case of k = 3 by Klaus F. Roth in 1953 [11].
A fourth proof was obtained from the Pierre Dusart's inequality [12], of 1999 for the i-th prime, We show below a new proof of the same result.

A New Proof
A new proof shows the diversity of ways of solving the same problem by different techniques, and helps us to better understand the original problem, analyzing it from different points of view.
For our purposes, arithmetic functions are fundamental. A function f is called an arithmetic function whose domain is N and whose codomain is R or C; in our case, typically, R.
An arithmetic function f is said to be additive if f (mn) = f (m) + f (n) with gcd(m, n) = 1; and completely additive if f (mn) = f (m) + f (n) for all m, n ∈ N. An arithmetic function is also defined as multiplicative if f (mn) = f (m) f (n) with gcd(m, n) = 1, and completely multiplicative if f (mn) = f (m) f (n) for all m, n ∈ N.
A main element of our proof is function ω(n), which is defined as the number of distinct prime divisors of n, which is additive but not completely additive. A completely additive function is Ω(n), defined as the number of prime divisors of n counting multiplicity. On the other hand, among multiplicative functions, we can mention ϕ(n), the number of positive integers less than n that are relatively prime to n, although not completely multiplicative. It is completely multiplicative, for example id(n) = n, the identity function.
In 1917, Godfrey H. Hardy and Srinivāsa A. Rāmānujan [13] proved that, if the number of distinct prime divisors of n, ω(n) is additively calculated up to a certain value, the arithmetic mean or average value tends to infinity: The latter is specifically the result that we need for our proof of (1). However, in order not to fall into a circular argument, since it is based on the divergence of the sum of the reciprocals of the primes, on the basis of (2), we need a previous theorem, which we present below. Theorem 1. The average sum of the number of distinct prime divisors of n tends to infinity: Proof. We build the following series of paired intervals, set of i pairs of intervals, ∀n ∈ N, n > 2: where n 2 i < 2, a value from which we can count prime numbers. Each element of each pair, with j = 1, . . . , i, 0, n 2 j , n 2 j , n 2 j−1 , has the same extension, which we call λ j = n 2 j . If we consider the new sequence of i + 1 elements, we see that the two intervals of lesser length are of equal length with the following recurrence: there is a number of different prime factors for each number of the interval, of value ω(b) − ω(a), which we call Ω j and calculate. So, from there, we analyze the convergence or divergence of the average sum of the number of distinct prime divisors of n.
In (4), we consider how many primes there are and, from them, how many prime factors appear. We do this from prime p i Considering values p i , p i + p i , p i + p i + p i , . . . that appear and so on.
We see that prime p i ∈ n 2k , n 2(k−1) , with k ∈ N, k ≥ 2, that appears in 0, n 2 , appears k − 1 times in 0, n 2 . Prime numbers p i ∈ n 2k , n 2k−1 , with k ≥ 2, that appear in 0, n 2 , appear one more time in the interval n 2 , n .
Thus, given a value n, primes in n 4 , n 2 are Π n 2 − Π n 4 , and appear only once in this interval, and therefore only once in 0, n 2 . Prime numbers in n 6 , n 4 are Π n 4 − Π n 6 , and appear only once in this interval, and 2 Π n 4 − Π n 6 in 0, n 2 . Primes in n 8 , n 6 are Π n 6 − Π n 8 , and appear only once in this interval, and 3 Π n 6 − Π n 8 in 0, n 2 , and so on. Hence, adding, we have as a result, in 0, n 2 , the total Π n 2 as long as n 2k ≥ 2, k ∈ N that we can bound by Π (2), so Considering values p i , p i + p i , p i + p i + p i + . . . that appear in n 2 , n , they are more than those in 0, n 2 . We have all those mentioned before, Π n 2 + Π n 4 + Π n 6 + Π n 8 + . . ., and also those that in their intervals that we saw that added one more, . ., as well as all the new primes that appear in this interval, Π (n) − Π n 2 ; so, by adding, we get the total that we can bound by Π (2), which is the number of different factors in the interval n 2 , n : In this way, for any value n ∈ N, if we consider the first half (6) versus the second half (7) of the interval, we have that the difference between the number of different factors shows that in the interval n 2 , n is greater in an amount versus the amount in 0, n 2 . So, for different Ω j , with j = 1, . . . , i + 1, we have that . . . , From Ω j and λ j , with j = 1, . . . , i + 1, we build sequence which is a monotonically increasing succession, by (5) and (8).
The value of term a i+1 , developing the numerator, where It turns out to be so that the numerator value of a i+1 is another way to calculate ω(x) = ∑ n≤x ω(n), and a i+1 another expression of x . With our choice of variables To study its convergence or divergence, because it is not a typical sequence or a typical numerical series of addends under a single index in the sum, we apply the following method: Taking n = 10, the sum of terms is: = a 1 + a 2 + . . . + a 20 , and so on. We can put many of the terms of the sequence S j , with j > 1, as values already present in the previous sequence S j−1 . For example, for S 2 and S 3 : S 2 = a 1 + a 2 + a 3 + a 4 + a 5 + a 6 + a 7 + a 8 + a 9 + a 10 = = a 1 + a 2 + a 4 + a 6 + a 8 + a 10 + a 3 + a 5 + a 7 + a 9 = = a 1 + 1 2 S 1 + a 3 + a 5 + a 7 + a 9 > > a 1 + 1 2 S 1 + a 4 + a 6 + a 8 + a 10 = = a 1 + 1 2 S 1 + 1 2 S 1 − a 2 = a 1 − a 2 + S 1 . Thus, an expression that we can put as Approximating we have If we consider that ln(5·2 δ )−ln 2 2 ln(5·2 δ )(ln 2+ln(5·2 δ )) = δ ln 2+ln 5−ln 2 2(ln 5+δ ln 2)(ln 2+ln 5+δ ln 2) > > δ ln 2 2(2+δ)(3+δ) > 1 2 δ to know lim t→∞ S t , it is enough to calculate the limit to infinity of the summation of the last expression, which is the subtraction between a divergent series and a convergent (of value 3 4 π 2 /6 − 49/36 ) series, so the total diverges; hence, lim t→∞ S t tends to infinity and also (9), and this completes the proof of (3).
The sum of the reciprocals of all prime numbers diverges: Proof. We have We can interpret this result as a sum extended over certain lattice points in the pr plane, lying on a hyperbola, with n, p, r ∈ N and p prime ( Figure 1). If we put the lattice points for all n = pr values on the hyperbolas, and we select those points in the graph, always taking the p values of the columns, it is clear that ω(n) corresponds to the number of lattice points of the graph. Each hyperbola corresponds to a different number n, without intersections between them. They must pass, among others, through all the lattice points n = (n 1 , n 2 ) /n, n 1 , n 2 ∈ N.