Hubbry Logo
Totient summatory functionTotient summatory functionMain
Open search
Totient summatory function
Community hub
Totient summatory function
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Totient summatory function
from Wikipedia

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 ≤ pqn.

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

[edit]

Applying Möbius inversion to the totient function yields

where is the Möbius function. Φ(n) has the asymptotic expansion

where ζ(2) is the Riemann zeta function evaluated at 2, which is .[1]

Reciprocal totient summatory function

[edit]

The summatory function of the reciprocal of the totient is

Edmund Landau showed in 1900 that this function has the asymptotic behavior[2]

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,[3] and its value is

See also

[edit]

References

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
Add your contribution
Related Hubs
User Avatar
No comments yet.