MathLiveEuler's totient function product formula
Gives the number of positive integers up to n that are relatively prime to n, computed from the distinct prime divisors of n. It is used in number theory, for example in Euler's theorem and in the study of multiplicative functions.
\varphi(n)=n\prod_{p|n}\left(1-\frac{1}{p}\right)What the symbols mean
| Euler's totient of n, the count of integers from 1 to n coprime to n | |
| positive integer | |
| prime number ranging over the distinct primes dividing n |
About this formula
- FieldMathematics
- TopicNumber theory
- LevelUniversity
- Also calledEuler totient function, totient function formula, phi function, Euler phi function, totient product formula, number of integers coprime to n
- SourceWikidata Q190026
Write it in Obsidian
MathLive is a free visual math editor for Obsidian. Run Find a formula, type “euler's totient function product formula”, and it goes into your note as editable LaTeX. You can also scan formulas from screenshots, PDFs and handwriting.