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).
Multiplicative group of integers modulo n Ramanujan sum Totient summatory function (𝛷) "Euler's totient function". Khan Academy. Retrieved 2016-02-26. Long (1972
{\displaystyle p^{5}} where p {\displaystyle p} is prime. 32 is the totient summatory function Φ ( n ) {\displaystyle \Phi (n)} over the first 10 integers, and
related function is the divisor summatory function, which, as the name implies, is a sum over the divisor function. The sum of positive divisors function σz(n)
formulas more generally for the related summatory functions over so-termed factorial moments of the function ω ( n ) {\displaystyle \omega (n)} . A known
(f)=q^{2n}(1-q^{-1}).} Divisor summatory function Normal order of an arithmetic function Extremal orders of an arithmetic function Divisor sum identities Hardy
ln n / ln 2 It is conjectured that the Mertens function, or summatory function of the Möbius function, satisfies lim sup n → ∞ | M ( x ) | x = + ∞ , {\displaystyle