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 (p,q), where 1 ≤ p ≤ q ≤ n.
The first few values are 0, 1, 2, 4, 6, 10, 12, 18, 22, 28, 32, ... (sequence A002088 in the OEIS). Values for powers of 10 are 1, 32, 3044, 304192, 30397486, 3039650754, ... (sequence A064018 in the OEIS).
Properties
The following identity holds for all real
:
.
This gives an implicit recurrence for the totient summatory function.1: 138
Applying Möbius inversion to the totient function or the above identity yields

where
is the Möbius function. Then it can be shown that Φ(n) has the asymptotic expansion

where ζ(2) is the Riemann zeta function evaluated at 2, which is
.1: 462–463 2
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 behavior3

where γ is the Euler–Mascheroni constant,

and

The constant A = 1.943596... 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,4 and its value is

See also
See also
References
References
- Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren. Concrete Mathematics (2 ed.). Addison-Wesley. ISBN 0-201-55802-5.
- Weisstein, Eric W., "Riemann Zeta Function \zeta(2)", MathWorld
- Landau, E. (1900), "Ueber die zahlentheoretische Funktion
und ihre Beziehung zum Goldbachschen Satz", Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse, 1900: 177–186
- OEIS: A065483
External links
External links