# Euler's totient function

(Redirected from Totient function)
Jump to navigation Jump to search
The first thousand values of φ(n). The points on the top line represent φ(p) when p is a prime number, which is p − 1.[1]

In number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. It is written using the Greek letter phi as ${\displaystyle \varphi (n)}$ or ${\displaystyle \phi (n)}$, and may also be called Euler's phi function. In other words, it is the number of integers k in the range 1 ≤ kn for which the greatest common divisor gcd(n, k) is equal to 1.[2][3] The integers k of this form are sometimes referred to as totatives of n.

For example, the totatives of n = 9 are the six numbers 1, 2, 4, 5, 7 and 8. They are all relatively prime to 9, but the other three numbers in this range, 3, 6, and 9 are not, since gcd(9, 3) = gcd(9, 6) = 3 and gcd(9, 9) = 9. Therefore, φ(9) = 6. As another example, φ(1) = 1 since for n = 1 the only integer in the range from 1 to n is 1 itself, and gcd(1, 1) = 1.

Euler's totient function is a multiplicative function, meaning that if two numbers m and n are relatively prime, then φ(mn) = φ(m)φ(n).[4][5] This function gives the order of the multiplicative group of integers modulo n (the group of units of the ring /n).[6] It is also used for defining the RSA encryption system.

## History, terminology, and notation

Leonhard Euler introduced the function in 1763.[7][8][9] However, he did not at that time choose any specific symbol to denote it. In a 1784 publication, Euler studied the function further, choosing the Greek letter π to denote it: he wrote πD for "the multitude of numbers less than D, and which have no common divisor with it".[10] This definition varies from the current definition for the totient function at D = 1 but is otherwise the same. The now-standard notation[8][11] φ(A) comes from Gauss's 1801 treatise Disquisitiones Arithmeticae,[12][13] although Gauss didn't use parentheses around the argument and wrote φA. Thus, it is often called Euler's phi function or simply the phi function.

In 1879, J. J. Sylvester coined the term totient for this function,[14][15] so it is also referred to as Euler's totient function, the Euler totient, or Euler's totient. Jordan's totient is a generalization of Euler's.

The cototient of n is defined as nφ(n). It counts the number of positive integers less than or equal to n that have at least one prime factor in common with n.

## Computing Euler's totient function

There are several formulas for computing φ(n).

### Euler's product formula

It states

${\displaystyle \varphi (n)=n\prod _{p\mid n}\left(1-{\frac {1}{p}}\right),}$

where the product is over the distinct prime numbers dividing n. (For notation, see Arithmetical function.)

An equivalent formulation for ${\displaystyle n=p_{1}^{k_{1}}p_{2}^{k_{2}}\cdots p_{r}^{k_{r}}}$, where ${\displaystyle p_{1},p_{2},\ldots ,p_{r}}$ are the distinct primes dividing n, is:

${\displaystyle \varphi (n)=p_{1}^{k_{1}-1}(p_{1}{-}1)\,p_{2}^{k_{2}-1}(p_{2}{-}1)\cdots p_{r}^{k_{r}-1}(p_{r}{-}1).}$

The proof of these formulas depends on two important facts.

#### Phi is a multiplicative function

This means that if gcd(m, n) = 1, then φ(m) φ(n) = φ(mn). Proof outline: Let A, B, C be the sets of positive integers which are coprime to and less than m, n, mn, respectively, so that |A| = φ(m), etc. Then there is a bijection between A × B and C by the Chinese remainder theorem.

#### Value of phi for a prime power argument

If p is prime and k ≥ 1, then

${\displaystyle \varphi \left(p^{k}\right)=p^{k}-p^{k-1}=p^{k-1}(p-1)=p^{k}\left(1-{\tfrac {1}{p}}\right).}$

Proof: Since p is a prime number, the only possible values of gcd(pk, m) are 1, p, p2, ..., pk, and the only way to have gcd(pk, m) > 1 is if m is a multiple of p, i.e. m = p, 2p, 3p, ..., pk − 1p = pk, and there are pk − 1 such multiples less than pk. Therefore, the other pkpk − 1 numbers are all relatively prime to pk.

#### Proof of Euler's product formula

The fundamental theorem of arithmetic states that if n > 1 there is a unique expression ${\displaystyle n=p_{1}^{k_{1}}p_{2}^{k_{2}}\cdots p_{r}^{k_{r}},}$ where p1 < p2 < ... < pr are prime numbers and each ki ≥ 1. (The case n = 1 corresponds to the empty product.) Repeatedly using the multiplicative property of φ and the formula for φ(pk) gives

${\displaystyle {\begin{array}{rcl}\varphi (n)&=&\varphi (p_{1}^{k_{1}})\,\varphi (p_{2}^{k_{2}})\cdots \varphi (p_{r}^{k_{r}})\\[.1em]&=&p_{1}^{k_{1}-1}(p_{1}-1)\,p_{2}^{k_{2}-1}(p_{2}-1)\cdots p_{r}^{k_{r}-1}(p_{r}-1)\\[.1em]&=&p_{1}^{k_{1}}\left(1-{\frac {1}{p_{1}}}\right)p_{2}^{k_{2}}\left(1-{\frac {1}{p_{2}}}\right)\cdots p_{r}^{k_{r}}\left(1-{\frac {1}{p_{r}}}\right)\\[.1em]&=&p_{1}^{k_{1}}p_{2}^{k_{2}}\cdots p_{r}^{k_{r}}\left(1-{\frac {1}{p_{1}}}\right)\left(1-{\frac {1}{p_{2}}}\right)\cdots \left(1-{\frac {1}{p_{r}}}\right)\\[.1em]&=&n\left(1-{\frac {1}{p_{1}}}\right)\left(1-{\frac {1}{p_{2}}}\right)\cdots \left(1-{\frac {1}{p_{r}}}\right).\end{array}}}$

This gives both versions of Euler's product formula.

An alternative proof that does not require the multiplicative property instead uses the inclusion-exclusion principle applied to the set ${\displaystyle \{1,2,\ldots ,n\}}$, excluding the sets of integers divisible by the prime divisors.

#### Example

${\displaystyle \varphi (20)=\varphi (2^{2}5)=20\,(1-{\tfrac {1}{2}})\,(1-{\tfrac {1}{5}})=20\cdot {\tfrac {1}{2}}\cdot {\tfrac {4}{5}}=8.}$

In words: the distinct prime factors of 20 are 2 and 5; half of the twenty integers from 1 to 20 are divisible by 2, leaving ten; a fifth of those are divisible by 5, leaving eight numbers coprime to 20; these are: 1, 3, 7, 9, 11, 13, 17, 19.

The alternative formula uses only integers:

${\displaystyle \varphi (20)=\varphi (2^{2}5^{1})=2^{2-1}(2{-}1)\,5^{1-1}(5{-}1)=2\cdot 1\cdot 1\cdot 4=8.}$

### Fourier transform

The totient is the discrete Fourier transform of the gcd, evaluated at 1.[16] Let

${\displaystyle {\mathcal {F}}\{\mathbf {x} \}[m]=\sum \limits _{k=1}^{n}x_{k}\cdot e^{{-2\pi i}{\frac {mk}{n}}}}$

where xk = gcd(k,n) for k ∈ {1, …, n}. Then

${\displaystyle \varphi (n)={\mathcal {F}}\{\mathbf {x} \}[1]=\sum \limits _{k=1}^{n}\gcd(k,n)e^{-2\pi i{\frac {k}{n}}}.}$

The real part of this formula is

${\displaystyle \varphi (n)=\sum \limits _{k=1}^{n}\gcd(k,n)\cos {\tfrac {2\pi k}{n}}.}$

For example, using ${\displaystyle \cos {\tfrac {\pi }{5}}={\tfrac {{\sqrt {5}}+1}{4}}}$ and ${\displaystyle \cos {\tfrac {2\pi }{5}}={\tfrac {{\sqrt {5}}-1}{4}}}$:

${\displaystyle {\begin{array}{rcl}\varphi (10)&=&\gcd(1,10)\cos {\tfrac {2\pi }{10}}+\gcd(2,10)\cos {\tfrac {4\pi }{10}}+\gcd(3,10)\cos {\tfrac {6\pi }{10}}+\cdots +\gcd(10,10)\cos {\tfrac {20\pi }{10}}\\&=&1\cdot ({\tfrac {{\sqrt {5}}+1}{4}})+2\cdot ({\tfrac {{\sqrt {5}}-1}{4}})+1\cdot (-{\tfrac {{\sqrt {5}}-1}{4}})+2\cdot (-{\tfrac {{\sqrt {5}}+1}{4}})+5\cdot (-1)\\&&+\ 2\cdot (-{\tfrac {{\sqrt {5}}+1}{4}})+1\cdot (-{\tfrac {{\sqrt {5}}-1}{4}})+2\cdot ({\tfrac {{\sqrt {5}}-1}{4}})+1\cdot ({\tfrac {{\sqrt {5}}+1}{4}})+10\cdot (1)\\&=&4.\end{array}}}$

Unlike the Euler product and the divisor sum formula, this one does not require knowing the factors of n. However, it does involve the calculation of the greatest common divisor of n and every positive integer less than n, which suffices to provide the factorization anyway.

### Divisor sum

The property established by Gauss,[17] that

${\displaystyle \sum _{d\mid n}\varphi (d)=n,}$

where the sum is over all positive divisors d of n, can be proven in several ways. (See Arithmetical function for notational conventions.)

One proof is to note that φ(d) is also equal to the number of possible generators of the cyclic group Cd ; specifically, if Cd = ⟨g with gd = 1, then gk is a generator for every k coprime to d. Since every element of Cn generates a cyclic subgroup, and all subgroups CdCn are generated by some element of Cn, the formula follows.[18] Equivalently, the formula can be derived by the same argument applied to the multiplicative group of the nth roots of unity and the primitive dth roots of unity.

The formula can also be derived from elementary arithmetic.[19] For example, let n = 20 and consider the positive fractions up to 1 with denominator 20:

${\displaystyle {\tfrac {1}{20}},\,{\tfrac {2}{20}},\,{\tfrac {3}{20}},\,{\tfrac {4}{20}},\,{\tfrac {5}{20}},\,{\tfrac {6}{20}},\,{\tfrac {7}{20}},\,{\tfrac {8}{20}},\,{\tfrac {9}{20}},\,{\tfrac {10}{20}},\,{\tfrac {11}{20}},\,{\tfrac {12}{20}},\,{\tfrac {13}{20}},\,{\tfrac {14}{20}},\,{\tfrac {15}{20}},\,{\tfrac {16}{20}},\,{\tfrac {17}{20}},\,{\tfrac {18}{20}},\,{\tfrac {19}{20}},\,{\tfrac {20}{20}}.}$

Put them into lowest terms:

${\displaystyle {\tfrac {1}{20}},\,{\tfrac {1}{10}},\,{\tfrac {3}{20}},\,{\tfrac {1}{5}},\,{\tfrac {1}{4}},\,{\tfrac {3}{10}},\,{\tfrac {7}{20}},\,{\tfrac {2}{5}},\,{\tfrac {9}{20}},\,{\tfrac {1}{2}},\,{\tfrac {11}{20}},\,{\tfrac {3}{5}},\,{\tfrac {13}{20}},\,{\tfrac {7}{10}},\,{\tfrac {3}{4}},\,{\tfrac {4}{5}},\,{\tfrac {17}{20}},\,{\tfrac {9}{10}},\,{\tfrac {19}{20}},\,{\tfrac {1}{1}}}$

These twenty fractions are all the positive k/d ≤ 1 whose denominators are the divisors d = 1, 2, 4, 5, 10, 20. The fractions with 20 as denominator are those with numerators relatively prime to 20, namely 1/20, 3/20, 7/20, 9/20, 11/20, 13/20, 17/20, 19/20; by definition this is φ(20) fractions. Similarly, there are φ(10) fractions with denominator 10, and φ(5) fractions with denominator 5, etc. Thus the set of twenty fractions is split into subsets of size φ(d) for each d dividing 20. A similar argument applies for any n.

Möbius inversion applied to the divisor sum formula gives

${\displaystyle \varphi (n)=\sum _{d\mid n}\mu \left(d\right)\cdot {\frac {n}{d}}=n\sum _{d\mid n}{\frac {\mu (d)}{d}},}$

where μ is the Möbius function, the multiplicative function defined by ${\displaystyle \mu (p)=-1}$ and ${\displaystyle \mu (p^{k})=0}$ for each prime p and k ≥ 1. This formula may also be derived from the product formula by multiplying out ${\displaystyle \textstyle \prod _{p\mid n}(1-{\frac {1}{p}})}$ to get ${\displaystyle \textstyle \sum _{d\mid n}{\frac {\mu (d)}{d}}.}$

An example:

{\displaystyle {\begin{aligned}\varphi (20)&=\mu (1)\cdot 20+\mu (2)\cdot 10+\mu (4)\cdot 5+\mu (5)\cdot 4+\mu (10)\cdot 2+\mu (20)\cdot 1\\[.5em]&=1\cdot 20-1\cdot 10+0\cdot 5-1\cdot 4+1\cdot 2+0\cdot 1=8.\end{aligned}}}

## Some values

The first 100 values (sequence A000010 in the OEIS) are shown in the table and graph below:

Graph of the first 100 values
φ(n) for 1 ≤ n ≤ 100
+ 1 2 3 4 5 6 7 8 9 10
0 1 1 2 2 4 2 6 4 6 4
10 10 4 12 6 8 8 16 6 18 8
20 12 10 22 8 20 12 18 12 28 8
30 30 16 20 16 24 12 36 18 24 16
40 40 12 42 20 24 22 46 16 42 20
50 32 24 52 18 40 24 36 28 58 16
60 60 30 36 32 48 20 66 32 44 24
70 70 24 72 36 40 36 60 24 78 32
80 54 40 82 24 64 42 56 40 88 24
90 72 44 60 46 72 32 96 42 60 40

In the graph at right the top line y = n − 1 is an upper bound valid for all n other than one, and attained if and only if n is a prime number. A simple lower bound is ${\displaystyle \varphi (n)\geq {\sqrt {n/2}}}$, which is rather loose: in fact, the lower limit of the graph is proportional to n/log log n.[20]

## Euler's theorem

This states that if a and n are relatively prime then

${\displaystyle a^{\varphi (n)}\equiv 1\mod n.}$

The special case where n is prime is known as Fermat's little theorem.

This follows from Lagrange's theorem and the fact that φ(n) is the order of the multiplicative group of integers modulo n.

The RSA cryptosystem is based on this theorem: it implies that the inverse of the function aae mod n, where e is the (public) encryption exponent, is the function bbd mod n, where d, the (private) decryption exponent, is the multiplicative inverse of e modulo φ(n). The difficulty of computing φ(n) without knowing the factorization of n is thus the difficulty of computing d: this is known as the RSA problem which can be solved by factoring n. The owner of the private key knows the factorization, since an RSA private key is constructed by choosing n as the product of two (randomly chosen) large primes p and q. Only n is publicly disclosed, and given the difficulty to factor large numbers we have the guarantee that no one else knows the factorization.

## Other formulae

• ${\displaystyle a\mid b\implies \varphi (a)\mid \varphi (b)}$
• ${\displaystyle n\mid \varphi (a^{n}-1)\quad {\text{for }}a,n>1}$
• ${\displaystyle \varphi (mn)=\varphi (m)\varphi (n)\cdot {\frac {d}{\varphi (d)}}\quad {\text{where }}d=\operatorname {gcd} (m,n)}$
Note the special cases
• ${\displaystyle \varphi (2m)={\begin{cases}2\varphi (m)&{\text{ if }}m{\text{ is even}}\\\varphi (m)&{\text{ if }}m{\text{ is odd}}\end{cases}}}$
• ${\displaystyle \varphi \left(n^{m}\right)=n^{m-1}\varphi (n)}$
• ${\displaystyle \varphi (\operatorname {lcm} (m,n))\cdot \varphi (\operatorname {gcd} (m,n))=\varphi (m)\cdot \varphi (n)}$
Compare this to the formula
• ${\displaystyle \operatorname {lcm} (m,n)\cdot \operatorname {gcd} (m,n)=m\cdot n}$
(See least common multiple.)
• φ(n) is even for n ≥ 3. Moreover, if n has r distinct odd prime factors, 2r | φ(n)
• For any a > 1 and n > 6 such that 4 ∤ n there exists an l ≥ 2n such that l | φ(an − 1).
• ${\displaystyle {\frac {\varphi (n)}{n}}={\frac {\varphi (\operatorname {rad} (n))}{\operatorname {rad} (n)}}}$
where rad(n) is the radical of n (the product of all distinct primes dividing n).
• ${\displaystyle \sum _{d\mid n}{\frac {\mu ^{2}(d)}{\varphi (d)}}={\frac {n}{\varphi (n)}}}$ [21]
• ${\displaystyle \sum _{1\leq k\leq n \atop (k,n)=1}\!\!k={\tfrac {1}{2}}n\varphi (n)\quad {\text{for }}n>1}$
• ${\displaystyle \sum _{k=1}^{n}\varphi (k)={\tfrac {1}{2}}\left(1+\sum _{k=1}^{n}\mu (k)\left\lfloor {\frac {n}{k}}\right\rfloor ^{2}\right)={\frac {3}{\pi ^{2}}}n^{2}+O\left(n(\log n)^{\frac {2}{3}}(\log \log n)^{\frac {4}{3}}\right)}$ ([22] cited in[23])
• ${\displaystyle \sum _{k=1}^{n}{\frac {\varphi (k)}{k}}=\sum _{k=1}^{n}{\frac {\mu (k)}{k}}\left\lfloor {\frac {n}{k}}\right\rfloor ={\frac {6}{\pi ^{2}}}n+O\left((\log n)^{\frac {2}{3}}(\log \log n)^{\frac {4}{3}}\right)}$ [22]
• ${\displaystyle \sum _{k=1}^{n}{\frac {k}{\varphi (k)}}={\frac {315\,\zeta (3)}{2\pi ^{4}}}n-{\frac {\log n}{2}}+O\left((\log n)^{\frac {2}{3}}\right)}$ [24]
• ${\displaystyle \sum _{k=1}^{n}{\frac {1}{\varphi (k)}}={\frac {315\,\zeta (3)}{2\pi ^{4}}}\left(\log n+\gamma -\sum _{p{\text{ prime}}}{\frac {\log p}{p^{2}-p+1}}\right)+O\left({\frac {(\log n)^{\frac {2}{3}}}{n}}\right)}$ [24]
(where γ is the Euler–Mascheroni constant).
• ${\displaystyle \sum _{\stackrel {1\leq k\leq n}{\operatorname {gcd} (k,m)=1}}\!\!\!\!1=n{\frac {\varphi (m)}{m}}+O\left(2^{\omega (m)}\right)}$
where m > 1 is a positive integer and ω(m) is the number of distinct prime factors of m.[25]

### Menon's identity

In 1965 P. Kesava Menon proved

${\displaystyle \sum _{\stackrel {1\leq k\leq n}{\gcd(k,n)=1}}\!\!\!\!\gcd(k-1,n)=\varphi (n)d(n),}$

where d(n) = σ0(n) is the number of divisors of n.

### Formulae involving the golden ratio

Schneider[26] found a pair of identities connecting the totient function, the golden ratio and the Möbius function μ(n). In this section φ(n) is the totient function, and ϕ = 1 + 5/2 = 1.618… is the golden ratio.

They are:

${\displaystyle \phi =-\sum _{k=1}^{\infty }{\frac {\varphi (k)}{k}}\log \left(1-{\frac {1}{\phi ^{k}}}\right)}$

and

${\displaystyle {\frac {1}{\phi }}=-\sum _{k=1}^{\infty }{\frac {\mu (k)}{k}}\log \left(1-{\frac {1}{\phi ^{k}}}\right).}$

Subtracting them gives

${\displaystyle \sum _{k=1}^{\infty }{\frac {\mu (k)-\varphi (k)}{k}}\log \left(1-{\frac {1}{\phi ^{k}}}\right)=1.}$

Applying the exponential function to both sides of the preceding identity yields an infinite product formula for e:

${\displaystyle e=\prod _{k=1}^{\infty }\left(1-{\frac {1}{\phi ^{k}}}\right)\!\!^{\frac {\mu (k)-\varphi (k)}{k}}.}$

The proof is based on the two formulae

{\displaystyle {\begin{aligned}\sum _{k=1}^{\infty }{\frac {\varphi (k)}{k}}\left(-\log \left(1-x^{k}\right)\right)&={\frac {x}{1-x}}\\{\text{and}}\;\sum _{k=1}^{\infty }{\frac {\mu (k)}{k}}\left(-\log \left(1-x^{k}\right)\right)&=x,\qquad \quad {\text{for }}0

## Generating functions

The Dirichlet series for φ(n) may be written in terms of the Riemann zeta function as:[27]

${\displaystyle \sum _{n=1}^{\infty }{\frac {\varphi (n)}{n^{s}}}={\frac {\zeta (s-1)}{\zeta (s)}}.}$

The Lambert series generating function is[28]

${\displaystyle \sum _{n=1}^{\infty }{\frac {\varphi (n)q^{n}}{1-q^{n}}}={\frac {q}{(1-q)^{2}}}}$

which converges for |q| < 1.

Both of these are proved by elementary series manipulations and the formulae for φ(n).

## Growth rate

In the words of Hardy & Wright, the order of φ(n) is “always ‘nearly n’.”[29]

First[30]

${\displaystyle \lim \sup {\frac {\varphi (n)}{n}}=1,}$

but as n goes to infinity,[31] for all δ > 0

${\displaystyle {\frac {\varphi (n)}{n^{1-\delta }}}\rightarrow \infty .}$

These two formulae can be proved by using little more than the formulae for φ(n) and the divisor sum function σ(n).

In fact, during the proof of the second formula, the inequality

${\displaystyle {\frac {6}{\pi ^{2}}}<{\frac {\varphi (n)\sigma (n)}{n^{2}}}<1,}$

true for n > 1, is proved.

We also have[20]

${\displaystyle \lim \inf {\frac {\varphi (n)}{n}}\log \log n=e^{-\gamma }.}$

Here γ is Euler's constant, γ = 0.577215665..., so eγ = 1.7810724... and eγ = 0.56145948....

Proving this does not quite require the prime number theorem.[32][33] Since log log n goes to infinity, this formula shows that

${\displaystyle \lim \inf {\frac {\varphi (n)}{n}}=0.}$

In fact, more is true.[34][35][36]

${\displaystyle \varphi (n)>{\frac {n}{e^{\gamma }\;\log \log n+{\frac {3}{\log \log n}}}}\quad {\text{for }}n>2}$

and

${\displaystyle \varphi (n)<{\frac {n}{e^{\gamma }\log \log n}}\quad {\text{for infinitely many }}n.}$

The second inequality was shown by Jean-Louis Nicolas. Ribenboim says "The method of proof is interesting, in that the inequality is shown first under the assumption that the Riemann hypothesis is true, secondly under the contrary assumption."[36]

For the average order, we have[22][37]

${\displaystyle \varphi (1)+\varphi (2)+\cdots +\varphi (n)={\frac {3n^{2}}{\pi ^{2}}}+O\left(n(\log n)^{\frac {2}{3}}(\log \log n)^{\frac {4}{3}}\right)\quad {\text{as }}n\rightarrow \infty ,}$

due to Arnold Walfisz, its proof exploiting estimates on exponential sums due to I. M. Vinogradov and N. M. Korobov (this is currently the best known estimate of this type). The "Big O" stands for a quantity that is bounded by a constant times the function of n inside the parentheses (which is small compared to n2).

This result can be used to prove[38] that the probability of two randomly chosen numbers being relatively prime is 6/π2.

## Ratio of consecutive values

In 1950 Somayajulu proved[39][40]

{\displaystyle {\begin{aligned}\lim \inf {\frac {\varphi (n+1)}{\varphi (n)}}&=0\quad {\text{and}}\\[5px]\lim \sup {\frac {\varphi (n+1)}{\varphi (n)}}&=\infty .\end{aligned}}}

In 1954 Schinzel and Sierpiński strengthened this, proving[39][40] that the set

${\displaystyle \left\{{\frac {\varphi (n+1)}{\varphi (n)}},\;\;n=1,2,\ldots \right\}}$

is dense in the positive real numbers. They also proved[39] that the set

${\displaystyle \left\{{\frac {\varphi (n)}{n}},\;\;n=1,2,\ldots \right\}}$

is dense in the interval (0,1).

## Totient numbers

A totient number is a value of Euler's totient function: that is, an m for which there is at least one n for which φ(n) = m. The valency or multiplicity of a totient number m is the number of solutions to this equation.[41] A nontotient is a natural number which is not a totient number. Every odd integer exceeding 1 is trivially a nontotient. There are also infinitely many even nontotients,[42] and indeed every positive integer has a multiple which is an even nontotient.[43]

The number of totient numbers up to a given limit x is

${\displaystyle {\frac {x}{\log x}}e^{{\big (}C+o(1){\big )}(\log \log \log x)^{2}}}$

for a constant C = 0.8178146....[44]

If counted accordingly to multiplicity, the number of totient numbers up to a given limit x is

${\displaystyle {\Big \vert }\{n:\varphi (n)\leq x\}{\Big \vert }={\frac {\zeta (2)\zeta (3)}{\zeta (6)}}\cdot x+R(x)}$

where the error term R is of order at most x/(log x)k for any positive k.[45]

It is known that the multiplicity of m exceeds mδ infinitely often for any δ < 0.55655.[46][47]

### Ford's theorem

Ford (1999) proved that for every integer k ≥ 2 there is a totient number m of multiplicity k: that is, for which the equation φ(n) = m has exactly k solutions; this result had previously been conjectured by Wacław Sierpiński,[48] and it had been obtained as a consequence of Schinzel's hypothesis H.[44] Indeed, each multiplicity that occurs, does so infinitely often.[44][47]

However, no number m is known with multiplicity k = 1. Carmichael's totient function conjecture is the statement that there is no such m.[49]

## Applications

### Cyclotomy

In the last section of the Disquisitiones[50][51] Gauss proves[52] that a regular n-gon can be constructed with straightedge and compass if φ(n) is a power of 2. If n is a power of an odd prime number the formula for the totient says its totient can be a power of two only if n is a first power and n − 1 is a power of 2. The primes that are one more than a power of 2 are called Fermat primes, and only five are known: 3, 5, 17, 257, and 65537. Fermat and Gauss knew of these. Nobody has been able to prove whether there are any more.

Thus, a regular n-gon has a straightedge-and-compass construction if n is a product of distinct Fermat primes and any power of 2. The first few such n are[53]

2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 32, 34, 40,... (sequence A003401 in the OEIS).

### The RSA cryptosystem

Setting up an RSA system involves choosing large prime numbers p and q, computing n = pq and k = φ(n), and finding two numbers e and d such that ed ≡ 1 (mod k). The numbers n and e (the "encryption key") are released to the public, and d (the "decryption key") is kept private.

A message, represented by an integer m, where 0 < m < n, is encrypted by computing S = me (mod n).

It is decrypted by computing t = Sd (mod n). Euler's Theorem can be used to show that if 0 < t < n, then t = m.

The security of an RSA system would be compromised if the number n could be factored or if φ(n) could be computed without factoring n.

## Unsolved problems

### Lehmer's conjecture

If p is prime, then φ(p) = p − 1. In 1932 D. H. Lehmer asked if there are any composite numbers n such that φ(n) divides n − 1. None are known.[54]

In 1933 he proved that if any such n exists, it must be odd, square-free, and divisible by at least seven primes (i.e. ω(n) ≥ 7). In 1980 Cohen and Hagis proved that n > 1020 and that ω(n) ≥ 14.[55] Further, Hagis showed that if 3 divides n then n > 101937042 and ω(n) ≥ 298848.[56][57]

### Carmichael's conjecture

This states that there is no number n with the property that for all other numbers m, mn, φ(m) ≠ φ(n). See Ford's theorem above.

As stated in the main article, if there is a single counterexample to this conjecture, there must be infinitely many counterexamples, and the smallest one has at least ten billion digits in base 10.[41]

## Notes

1. ^ "Euler's totient function". Khan Academy. Retrieved 2016-02-26.
2. ^ Long (1972, p. 85)
3. ^ Pettofrezzo & Byrkit (1970, p. 72)
4. ^ Long (1972, p. 162)
5. ^ Pettofrezzo & Byrkit (1970, p. 80)
6. ^ See Euler's theorem.
7. ^ L. Euler "Theoremata arithmetica nova methodo demonstrata" (An arithmetic theorem proved by a new method), Novi commentarii academiae scientiarum imperialis Petropolitanae (New Memoirs of the Saint-Petersburg Imperial Academy of Sciences), 8 (1763), 74–104. (The work was presented at the Saint-Petersburg Academy on October 15, 1759. A work with the same title was presented at the Berlin Academy on June 8, 1758). Available on-line in: Ferdinand Rudio, ed., Leonhardi Euleri Commentationes Arithmeticae, volume 1, in: Leonhardi Euleri Opera Omnia, series 1, volume 2 (Leipzig, Germany, B. G. Teubner, 1915), pages 531–555. On page 531, Euler defines n as the number of integers that are smaller than N and relatively prime to N (… aequalis sit multitudini numerorum ipso N minorum, qui simul ad eum sint primi, …), which is the phi function, φ(N).
8. ^ a b Sandifer, p. 203
9. ^ Graham et al. p. 133 note 111
10. ^ L. Euler, Speculationes circa quasdam insignes proprietates numerorum, Acta Academiae Scientarum Imperialis Petropolitinae, vol. 4, (1784), pp. 18–30, or Opera Omnia, Series 1, volume 4, pp. 105–115. (The work was presented at the Saint-Petersburg Academy on October 9, 1775).
11. ^ Both φ(n) and ϕ(n) are seen in the literature. These are two forms of the lower-case Greek letter phi.
12. ^ Gauss, Disquisitiones Arithmeticae article 38
13. ^ Cajori, Florian (1929). A History Of Mathematical Notations Volume II. Open Court Publishing Company. §409.
14. ^ J. J. Sylvester (1879) "On certain ternary cubic-form equations", American Journal of Mathematics, 2 : 357-393; Sylvester coins the term "totient" on page 361.
15. ^ "totient". Oxford English Dictionary (2nd ed.). Oxford University Press. 1989.
16. ^ Schramm (2008)
17. ^ Gauss, DA, art 39
18. ^ Gauss, DA art. 39, arts. 52-54
19. ^ Graham et al. pp. 134-135
20. ^ a b Hardy & Wright 1979, thm. 328
21. ^ Dineva (in external refs), prop. 1
22. ^ a b c Walfisz, Arnold (1963). Weylsche Exponentialsummen in der neueren Zahlentheorie. Mathematische Forschungsberichte (in German). 16. Berlin: VEB Deutscher Verlag der Wissenschaften. Zbl 0146.06003.
23. ^ Lomadse, G., "The scientific work of Arnold Walfisz" (PDF), Acta Arithmetica, 10 (3): 227–237
24. ^ a b Sitaramachandrarao, R. (1985). "On an error term of Landau II". Rocky Mountain J. Math. 15: 579–588.
25. ^ Bordellès in the external links
26. ^ All formulae in the section are from Schneider (in the external links)
27. ^ Hardy & Wright 1979, thm. 288
28. ^ Hardy & Wright 1979, thm. 309
29. ^ Hardy & Wright 1979, intro to § 18.4
30. ^ Hardy & Wright 1979, thm. 326
31. ^ Hardy & Wright 1979, thm. 327
32. ^ In fact Chebyshev's theorem (Hardy & Wright 1979, thm.7) and Mertens' third theorem is all that is needed.
33. ^ Hardy & Wright 1979, thm. 436
34. ^ Theorem 15 of Rosser, J. Barkley; Schoenfeld, Lowell (1962). "Approximate formulas for some functions of prime numbers". Illinois J. Math. 6 (1): 64–94.
35. ^ Bach & Shallit, thm. 8.8.7
36. ^ a b Ribenboim. The Book of Prime Number Records. Section 4.I.C.[full citation needed]
37. ^ Sándor, Mitrinović & Crstici (2006) pp.24–25
38. ^ Hardy & Wright 1979, thm. 332
39. ^ a b c Ribenboim, p.38
40. ^ a b Sándor, Mitrinović & Crstici (2006) p.16
41. ^ a b Guy (2004) p.144
42. ^ Sándor & Crstici (2004) p.230
43. ^ Zhang, Mingzhi (1993). "On nontotients". Journal of Number Theory. 43 (2): 168–172. doi:10.1006/jnth.1993.1014. ISSN 0022-314X. Zbl 0772.11001.
44. ^ a b c Ford, Kevin (1998). "The distribution of totients". Ramanujan J. 2 (1–2): 67–151. arXiv:1104.3264. doi:10.1007/978-1-4757-4507-8_8. ISSN 1382-4090. Zbl 0914.11053.
45. ^ Sándor et al (2006) p.22
46. ^ Sándor et al (2006) p.21
47. ^ a b Guy (2004) p.145
48. ^ Sándor & Crstici (2004) p.229
49. ^ Sándor & Crstici (2004) p.228
50. ^ Gauss, DA. The 7th § is arts. 336–366
51. ^ Gauss proved if n satisfies certain conditions then the n-gon can be constructed. In 1837 Pierre Wantzel proved the converse, if the n-gon is constructible, then n must satisfy Gauss's conditions
52. ^ Gauss, DA, art 366
53. ^ Gauss, DA, art. 366. This list is the last sentence in the Disquisitiones
54. ^ Ribenboim, pp. 36–37.
55. ^ Cohen, Graeme L.; Hagis, Peter, Jr. (1980). "On the number of prime factors of n if φ(n) divides n − 1". Nieuw Arch. Wiskd. III Series. 28: 177–185. ISSN 0028-9825. Zbl 0436.10002.
56. ^ Hagis, Peter, Jr. (1988). "On the equation M·φ(n) = n − 1". Nieuw Arch. Wiskd. IV Series. 6 (3): 255–261. ISSN 0028-9825. Zbl 0668.10006.
57. ^ Guy (2004) p.142

## References

The Disquisitiones Arithmeticae has been translated from Latin into English and German. The German edition includes all of Gauss' papers on number theory: all the proofs of quadratic reciprocity, the determination of the sign of the Gauss sum, the investigations into biquadratic reciprocity, and unpublished notes.

References to the Disquisitiones are of the form Gauss, DA, art. nnn.