Math 2.0

Number theory Definition

Euler's totient function

Builds on Coprime integers

Definition

Let nn be a positive integer. Euler's totient function φ(n)\varphi(n) is the number of integers kk with 1≤k≤n1 \le k \le n such that kk and nn are coprime.

Remarks

For example, φ(1)=1\varphi(1) = 1, φ(9)=6\varphi(9) = 6 and φ(12)=4\varphi(12) = 4. The integers coprime to 1212 in {1,…,12}\{1, \dots, 12\} are 1,5,7,111, 5, 7, 11. The number φ(n)\varphi(n) is the number of elements of a reduced residue system modulo nn. If n=p1e1⋯prern = p_1^{e_1} \cdots p_r^{e_r} with distinct primes pip_i, then φ(n)=n∏i=1r(1−1pi)\varphi(n) = n \prod_{i=1}^{r} \left(1 - \frac{1}{p_i}\right). The Lean library Mathlib sets φ(0)=0\varphi(0) = 0.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Divisibility definition
  2. Greatest common divisor definition
  3. Coprime integers definition
  4. Euler's totient function definition

Where this leads

17 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Euler%27s_totient_function, lead section
About this page
Tag0VV04M41AN
URIm2://0VV04M41AN
Aliaseseuler-phi-function, totient-function, phi-function
Kinddefinition
WritingW1 stated
MSC11A25
DefinesEuler's totient function
UsesCoprime integers

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by