Totient summatory function
{{Short description|Arithmetic function}}
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 {{Math|(p,q)}}, where {{Math|1 ≤ p ≤ q ≤ n}}.
The first few values are 0, 1, 2, 4, 6, 10, 12, 18, 22, 28, 32, ... {{OEIS|A002088}}. Values for powers of 10 are 1, 32, 3044, 304192, 30397486, 3039650754, ... {{OEIS|A064018}}.
Properties
Applying Möbius inversion to the totient function yields
:
{{math|Φ(n)}} has the asymptotic expansion
:
where {{math|ζ(2)}} is the Riemann zeta function evaluated at 2, which is .{{mathworld|title=Riemann Zeta Function \zeta(2)|id=RiemannZetaFunctionZeta2|mode=cs2}}
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 behavior{{Citation needed|date=February 2025}}
:
where {{math|γ}} is the Euler–Mascheroni constant,
:
and
:
The constant {{math|1= 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,{{OEIS2C|A065483}} and its value is
:
See also
References
{{reflist}}
- {{MathWorld|id=TotientSummatoryFunction|title=Totient Summatory Function}}
External links
- OEIS Totient summatory function
- [https://oeis.org/A065483 Decimal expansion of totient constant product(1 + 1/(p^2*(p-1))), p prime >= 2)]
{{Mathematics-stub}}