Totient summatory function

From testwiki
Jump to navigation Jump to search

Template:Short description In number theory, the totient summatory function Φ(n) is a summatory function of Euler's totient function defined by

Φ(n):=k=1nφ(k),n.

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

Φ(n)=k=1nkdkμ(d)d=12k=1nμ(k)nk(1+nk).

Template:Math has the asymptotic expansion

Φ(n)12ζ(2)n2+O(nlogn)=3π2n2+O(nlogn),

where Template:Math is the Riemann zeta function evaluated at 2, which is π26.[1]

Reciprocal totient summatory function

The summatory function of the reciprocal of the totient is

S(n):=k=1n1φ(k).

Edmund Landau showed in 1900 that this function has the asymptotic behaviorTemplate:Citation needed

S(n)A(γ+logn)+B+O(lognn),

where Template:Math is the Euler–Mascheroni constant,

A=k=1μ(k)2kφ(k)=ζ(2)ζ(3)ζ(6)=p(1+1p(p1)),

and

B=k=1μ(k)2logkkφ(k)=Ap(logpp2p+1).

The constant Template:Math is sometimes known as Landau's totient constant. The sum k=11/(kφ(k)) converges to

k=11kφ(k)=ζ(2)p(1+1p2(p1))=2.20386.

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

p(1+1p2(p1))=1.339784.

See also

References

Template:Reflist


Template:Mathematics-stub