Totient summatory function

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In number theory, the totient summatory function \Phi(n) is a summatory function of Euler's totient function defined by : \Phi(n) := \sum_{k=1}^n \varphi(k), \quad n\in \mathbb{N}. It is the number of ordered pairs of coprime integers , where . The first few values are 0, 1, 2, 4, 6, 10, 12, 18, 22, 28, 32, ... . Values for powers of 10 are 1, 32, 3044, 304192, 30397486, 3039650754, ... .

In number theory, the totient summatory function \Phi(n) is a summatory function of Euler's totient function defined by \Phi(n) := \sum_{k=1}^n \varphi(k), \quad n\in \mathbb{N}. It is the number of ordered pairs of coprime integers , where . The first few values are 0, 1, 2, 4, 6, 10, 12, 18, 22, 28, 32, ... . Values for powers of 10 are 1, 32, 3044, 304192, 30397486, 3039650754, ... . \sum_{d=1}^n \Phi\left(\frac{n}{d}\right)=\frac{1}{2}\lfloor n \rfloor \lfloor n+1 \rfloor . This gives an implicit recurrence for the totient summatory function.

Applying Möbius inversion to the totient function or the above identity yields \Phi(n) = \sum_{k=1}^n k\sum _{d\mid k} \frac {\mu (d)}{d} = \frac{1}{2} \sum _{k=1}^n \mu(k) \left\lfloor \frac {n}{k} \right\rfloor \left(1 + \left\lfloor \frac {n}{k} \right\rfloor \right), where \mu(n) is the Möbius function. Then it can be shown that has the asymptotic expansion \Phi(n) \sim \frac{1}{2\zeta(2)}n^{2}+O\left( n\log n \right ) = \frac{3}{\pi^2}n^2+O\left( n\log n \right), where is the Riemann zeta function evaluated at 2, which is \frac{\pi^2}{6} .

S(n) := \sum _{k=1}^{n}{\frac {1}{\varphi (k)}}. Edmund Landau showed in 1900 that this function has the asymptotic behavior S(n) \sim A (\gamma+\log n)+ B +O\left(\frac{\log n} n\right), where is the Euler–Mascheroni constant, A = \sum_{k=1}^\infty \frac{\mu (k)^2}{k \varphi(k)} = \frac{\zeta(2)\zeta(3)}{\zeta(6)} = \prod_{p\in\mathbb{P}} \left(1+\frac 1 {p(p-1)} \right), and B = \sum_{k=1}^{\infty} \frac{\mu (k)^2\log k}{k \,\varphi(k)} = A \, \prod _{p\in\mathbb{P}}\left(\frac {\log p}{p^2-p+1}\right).

The constant is sometimes known as Landau's totient constant. The sum \textstyle \sum _{k=1}^\infty 1 / (k \; \varphi (k)) converges to \sum _{k=1}^\infty \frac 1 {k\varphi (k)} = \zeta(2) \prod_{p\in\mathbb{P}} \left(1 + \frac 1 {p^2(p-1)}\right) =2.20386\ldots. In this case, the product over the primes in the right side is a constant known as the totient summatory constant, and its value is \prod_{p\in\mathbb{P}} \left(1+\frac 1 {p^2(p-1)} \right) = 1.339784\ldots.

External links

OEIS Totient summatory function Decimal expansion of totient constant product(1 + 1/(p^2*(p-1))), p prime >= 2)

Text derived from https://en.wikipedia.org/w/index.php?oldid=1355421993 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001355421993 · captured 1779383681.0 · version history

Cite this page as: encyclopegia.org, “Totient summatory function”, snapshot enwiki-001355421993. https://encyclopegia.org/a/totient-summatory-function

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.