Euler phi function
For any positive integer , is the number of positive integers less than or equal to which are coprime to . The function is known as the function. This function may also be denoted by .
Among the most useful of are the facts that it is multiplicative (meaning if , then ) and that for any prime and any positive integer . These two facts combined give a numeric computation of for all positive integers:
(1) |
For example,
From equation (1), it is clear that for any positive integer with equality holding exactly when . This is because
with equality holding exactly when .
Another important fact about the function is that
where the sum extends over all positive divisors of . Also, by definition, is the number of units in the ring of integers modulo .
The sequence appears in the OEIS as sequence http://www.research.att.com/ njas/sequences/A000010A000010.
Title | Euler phi function |
---|---|
Canonical name | EulerPhiFunction |
Date of creation | 2013-03-22 11:45:11 |
Last modified on | 2013-03-22 11:45:11 |
Owner | Wkbj79 (1863) |
Last modified by | Wkbj79 (1863) |
Numerical id | 19 |
Author | Wkbj79 (1863) |
Entry type | Definition |
Classification | msc 11A25 |
Classification | msc 11-00 |
Classification | msc 14F35 |
Classification | msc 14H30 |
Classification | msc 20F34 |
Synonym | Euler totient function |
Synonym | Euler function |
Synonym | Euler function |
Related topic | ProofThatEulerPhiIsAMultiplicativeFunction |
Related topic | ValuesOfNForWhichVarphintaun |
Related topic | PrimeResidueClass |
Related topic | EulerPhiAtAProduct |
Related topic | SummatoryFunctionOfArithmeticFunction |