Harmonic series
Consider the harmonic series 1+21+31+…
. Apparently, it was Donald Knuth who in 1968 (vol 1 of TAOCP, section 1.2.7 “Harmonic numbers”) gave the name “harmonic number” and the notation Hn
to the partial sums of this series: Hn=1+21+31+⋯+n1
It turns out that Hn=lnn+γ+2n1−12n21+120n41+…
where the terms for powers k≥2
are knkBk
.
Prime harmonic series
What about adding only the reciprocals of the prime numbers, namely
p prime∑p1=21+31+51+71+111+131+171+⋯
where we sum reciprocals of primes under some value x
?
This too diverges, though very slowly: it follows from the second theorem of Mertens that
p≤x∑p1=lnlnx+M+ϵ,
where M
is the Meissel–Mertens constant 0.26149721…. Here, for the error term ϵ
, Mertens proved that ∣ϵ∣≤ln(x+1)4+xlnx2
; this paper (see also this math.SE question and this MO question) shows that ϵ
changes sign infinitely often; and this 2016 paper by Pierre Dusart shows (its Theorem 5.6) that ∣ϵ∣≤ln3n0.2
for n≥2278383
.
The non-prime harmonic series
We can also take their difference, and consider
1+41+61+81+91+101+121+141+151+⋯
where we sum the reciprocals of non-prime integers under some value x
.
Being the difference of the two, this will grow like
lnx−lnlnx+(γ−M)+O(ln3n1)
Further questions
-
What if we take the above “prime harmonic series” and “composite harmonic series” to n
terms, instead of using values up to x
? (We’ll need estimates for the n
th prime and n
th composite number respectively.)
-
What about inverting these functions, i.e. given some x
, finding value of n
at which Hn
(or the prime harmonic series, or composite harmonic series) attains (or, first exceeds) the value x
? Can we estimate the asymptotics of that function?
Some of these questions are answered in this Colab notebook.