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

The following identity holds for all real n≥0:

∑d=1nΦ(nd)=12⌊n⌋⌊n+1⌋.

This gives an implicit recurrence for the totient summatory function.[1]Template:Rp

Applying Möbius inversion to the totient function or the above identity yields

Φ(n)=∑k=1nk∑d∣kμ(d)d=12∑k=1nμ(k)⌊nk⌋(1+⌊nk⌋),

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

Φ(n)∼12ζ(2)n2+O(nlog⁡n)=3π2n2+O(nlog⁡n),

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

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 behavior[3]

S(n)∼A(γ+log⁡n)+B+O(log⁡nn),

where Template:Math is the Euler–Mascheroni constant,

A=∑k=1∞μ(k)2kφ(k)=ζ(2)ζ(3)ζ(6)=∏p∈ℙ(1+1p(p−1)),

and

B=∑k=1∞μ(k)2log⁡kkφ(k)=A∏p∈ℙ(log⁡pp2−p+1).

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

∑k=1∞1kφ(k)=ζ(2)∏p∈ℙ(1+1p2(p−1))=2.20386….

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

∏p∈ℙ(1+1p2(p−1))=1.339784….

See also

References

Template:Reflist


Template:Number-theory-stub