Lesson plan
Totient summatory function
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, ... .
Article summary
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, ... .
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.