Difference between revisions of "Euler's phi function"
(Fixed LaTeX on old version; restores old info) |
(→Formulas: \left(and\right)) |
||
| Line 3: | Line 3: | ||
=== Formulas === | === Formulas === | ||
| − | Given the [[prime factorization]] of <math>n = | + | Given the [[prime factorization]] of <math>{n} = {p}_1^{e_1}{p}_2^{e_2} \cdots {p}_n^{e_n}</math>, then one formula for <math>\phi(n)</math> is <math> \phi(n) = n\left(1-\frac{1}{p_1}\right)\left(1-\frac{1}{p_2}\right) \cdots \left(1-\frac{1}{p_n}\right) </math>. |
| − | <math> \phi(n) = n(1-\frac{1}{p_1})(1-\frac{1}{p_2}) \cdots (1-\frac{1}{p_n}) </math> | + | |
| + | === See also === | ||
| + | |||
| + | * [[Number theory]] | ||
| + | * [[Prime]] | ||
| + | * [[Euler's Totient Theorem]] | ||
=== Identities === | === Identities === | ||
Revision as of 15:33, 18 June 2006
Euler's phi function determines the number of integers less than a given positive integer that are relatively prime to that integer.
Contents
Formulas
Given the prime factorization of 
, then one formula for 
is 
.
See also
Identities
For prime p, 
, because all numbers less than 
are relatively prime to it.
For relatively prime 
, 
.
Other Names
- Totient Function
- Euler's Totient Function
