Totient summatory function
Template:Short description In number theory, the totient summatory function is a summatory function of Euler's totient function defined by
It is the number of ordered pairs of coprime integers Template:Math, where Template:Math.
The first few values are 0, 1, 2, 4, 6, 10, 12, 18, 22, 28, 32, ... Template:OEIS. Values for powers of 10 are 1, 32, 3044, 304192, 30397486, 3039650754, ... Template:OEIS.
Properties
Applying Möbius inversion to the totient function yields
Template:Math has the asymptotic expansion
where Template:Math is the Riemann zeta function evaluated at 2, which is .[1]
Reciprocal totient summatory function
The summatory function of the reciprocal of the totient is
Edmund Landau showed in 1900 that this function has the asymptotic behaviorTemplate:Citation needed
where Template:Math is the Euler–Mascheroni constant,
and
The constant Template:Math is sometimes known as Landau's totient constant. The sum converges to
In this case, the product over the primes in the right side is a constant known as the totient summatory constant,[2] and its value is