# Difference between revisions of "Euler's totient function"

(→See also: add section, category) |
|||

Line 37: | Line 37: | ||

==Notation== | ==Notation== | ||

− | + | Often instead of <math>\phi</math>, also <math>\varphi</math> is used. | |

== See also == | == See also == |

## Revision as of 10:54, 30 January 2008

**Euler's totient function** applied to a positive integer is defined to be the number of positive integers less than or equal to that are relatively prime to . is read "phi of n."

## Contents

## Formulas

To derive the formula, let us first define the prime factorization of as where the are distinct prime numbers. Now, we can use a PIE argument to count the number of numbers less than or equal to that are relatively prime to it.

First, let's count the complement of what we want (i.e. all the numbers less than that share a common factor with it). There are numbers less than that are divisible by . If we do the same for each and add these up, we get

We can factor out, though:

But we are obviously overcounting. We then subtract out those divisible by two of the . We continue with this PIE argument to figure out that the number of elements in the complement of what we want is

which we can factor further as

Making one small adjustment, we write this as

Given the general prime factorization of , one can compute using the formula

## Identities

For prime p, , because all numbers less than are relatively prime to it.

For relatively prime , .

In fact, we also have for any that .

For any , we have where the sum is taken over all divisors d of .

## Notation

Often instead of , also is used.