Logic and Discrete Mathematics

Section 5.10
Wilson’s theorem
Order of an integer

Slides version: January 2015

 Wilson’s theorem

Theorem (Wilson’s theorem)

For every positive integer n > 1, n is a prime if and only if

(n − 1)! + 1 ≡ 0 (mod n).

 Order of an integer

Let n be a positive integer and gcd(n, a) = 1.

The least positive integer k such that ak ≡ 1 (mod n) is called
the order of a modulo m, denoted by ordn a.

Theorem (Properties of the order of an integer)

Let n be a positive integer, gcd(n, a) = 1, and k = ordn a. Then:
1. Every positive integer m for which am ≡ 1 (mod n) is a
multiple of k.
2. In particular, k | φ(n).
3. For any integers u, v : au ≡ av (mod n) iff u ≡ v (mod k ).
4. No two of the integers a, a2 , ..., ak are congruent modulo n.
k
5. For any positive integer m, ordn am = gcd(k ,m) .
 Order of an integer

Let n be a positive integer and gcd(n, a) = 1.

The least positive integer k such that ak ≡ 1 (mod n) is called
the order of a modulo m, denoted by ordn a.

Theorem (Properties of the order of an integer)

Let n be a positive integer, gcd(n, a) = 1, and k = ordn a. Then:
1. Every positive integer m for which am ≡ 1 (mod n) is a
multiple of k.
2. In particular, k | φ(n).
3. For any integers u, v : au ≡ av (mod n) iff u ≡ v (mod k ).
4. No two of the integers a, a2 , ..., ak are congruent modulo n.
k
5. For any positive integer m, ordn am = gcd(k ,m) .
 Order of an integer

Let n be a positive integer and gcd(n, a) = 1.

The least positive integer k such that ak ≡ 1 (mod n) is called
the order of a modulo m, denoted by ordn a.

Theorem (Properties of the order of an integer)

Let n be a positive integer, gcd(n, a) = 1, and k = ordn a. Then:
1. Every positive integer m for which am ≡ 1 (mod n) is a
multiple of k.
2. In particular, k | φ(n).
3. For any integers u, v : au ≡ av (mod n) iff u ≡ v (mod k ).
4. No two of the integers a, a2 , ..., ak are congruent modulo n.
k
5. For any positive integer m, ordn am = gcd(k ,m) .
 Order of an integer

Let n be a positive integer and gcd(n, a) = 1.

The least positive integer k such that ak ≡ 1 (mod n) is called
the order of a modulo m, denoted by ordn a.

Theorem (Properties of the order of an integer)

Let n be a positive integer, gcd(n, a) = 1, and k = ordn a. Then:
1. Every positive integer m for which am ≡ 1 (mod n) is a
multiple of k.
2. In particular, k | φ(n).
3. For any integers u, v : au ≡ av (mod n) iff u ≡ v (mod k ).
4. No two of the integers a, a2 , ..., ak are congruent modulo n.
k
5. For any positive integer m, ordn am = gcd(k ,m) .
 Order of an integer

Let n be a positive integer and gcd(n, a) = 1.

The least positive integer k such that ak ≡ 1 (mod n) is called
the order of a modulo m, denoted by ordn a.

Theorem (Properties of the order of an integer)

Let n be a positive integer, gcd(n, a) = 1, and k = ordn a. Then:
1. Every positive integer m for which am ≡ 1 (mod n) is a
multiple of k.
2. In particular, k | φ(n).
3. For any integers u, v : au ≡ av (mod n) iff u ≡ v (mod k ).
4. No two of the integers a, a2 , ..., ak are congruent modulo n.
k
5. For any positive integer m, ordn am = gcd(k ,m) .
 Order of an integer

Let n be a positive integer and gcd(n, a) = 1.

The least positive integer k such that ak ≡ 1 (mod n) is called
the order of a modulo m, denoted by ordn a.

Theorem (Properties of the order of an integer)

Let n be a positive integer, gcd(n, a) = 1, and k = ordn a. Then:
1. Every positive integer m for which am ≡ 1 (mod n) is a
multiple of k.
2. In particular, k | φ(n).
3. For any integers u, v : au ≡ av (mod n) iff u ≡ v (mod k ).
4. No two of the integers a, a2 , ..., ak are congruent modulo n.
k
5. For any positive integer m, ordn am = gcd(k ,m) .
 Order of an integer

Let n be a positive integer and gcd(n, a) = 1.

The least positive integer k such that ak ≡ 1 (mod n) is called
the order of a modulo m, denoted by ordn a.

Theorem (Properties of the order of an integer)

Let n be a positive integer, gcd(n, a) = 1, and k = ordn a. Then:
1. Every positive integer m for which am ≡ 1 (mod n) is a
multiple of k.
2. In particular, k | φ(n).
3. For any integers u, v : au ≡ av (mod n) iff u ≡ v (mod k ).
4. No two of the integers a, a2 , ..., ak are congruent modulo n.
k
5. For any positive integer m, ordn am = gcd(k ,m) .