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

(→Identities) |
|||

Line 1: | Line 1: | ||

− | |||

− | |||

'''Euler's totient function''' <math>\phi(n)</math> applied to a [[positive integer]] <math>n</math> is defined to be the number of positive integers less than or equal to <math>n</math> that are [[relatively prime]] to <math>n</math>. <math>\phi(n)</math> is read "phi of n." | '''Euler's totient function''' <math>\phi(n)</math> applied to a [[positive integer]] <math>n</math> is defined to be the number of positive integers less than or equal to <math>n</math> that are [[relatively prime]] to <math>n</math>. <math>\phi(n)</math> is read "phi of n." | ||

## Revision as of 17:18, 26 July 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 .

Proof. Split the set into disjoint sets where for all we have Now if and only if . Furthermore, if and only if . Now one can see that the number of elements of equals the number of elements of Thus by the definition of Euler's phi we have that . As every integer which satisfies belongs in exactly one of the sets , we have that

## Notation

Sometimes, instead of , is used. This variation of the Greek letter *phi* is common in textbooks, and is standard usage on the English Wikipedia