Professional Documents
Culture Documents
13 Linear Congruences
13 Linear Congruences
Linear Congruences
Bernd Schröder
Introduction
Introduction
1. Linear equations, that is, equations of the form ax = b are
the simplest type of equation we can encounter.
Introduction
1. Linear equations, that is, equations of the form ax = b are
the simplest type of equation we can encounter.
2. In this presentation, we will consider what happens when
equality is replaced with congruence modulo m.
Introduction
1. Linear equations, that is, equations of the form ax = b are
the simplest type of equation we can encounter.
2. In this presentation, we will consider what happens when
equality is replaced with congruence modulo m.
3. We will also see how the solution of multiple very simple
equations of this type leads to the Chinese Remainder
Theorem
Introduction
1. Linear equations, that is, equations of the form ax = b are
the simplest type of equation we can encounter.
2. In this presentation, we will consider what happens when
equality is replaced with congruence modulo m.
3. We will also see how the solution of multiple very simple
equations of this type leads to the Chinese Remainder
Theorem, which is important because it paves the way for
efficiently working with large numbers.
Introduction
1. Linear equations, that is, equations of the form ax = b are
the simplest type of equation we can encounter.
2. In this presentation, we will consider what happens when
equality is replaced with congruence modulo m.
3. We will also see how the solution of multiple very simple
equations of this type leads to the Chinese Remainder
Theorem, which is important because it paves the way for
efficiently working with large numbers.
4. We will conclude with some results about numbers of the
form 2n − 1, because these numbers are often used as the
moduli in computer arithmetics.
Theorem.
Proof.
Proof (cont.).
Proof (cont.).
Corollary.
Proof.
Definition.
Example.
Theorem.
Proof.
Theorem.
Proof.
Theorem.
Proof.
Proof (concl.).
Proof (concl.). For the uniqueness, note that if x and y are two
solutions
Proof (concl.). For the uniqueness, note that if x and y are two
solutions, then x ≡ aj ≡ y (mod mj )
Proof (concl.). For the uniqueness, note that if x and y are two
solutions, then x ≡ aj ≡ y (mod mj ), that is, mj |(x − y) for all j.
Proof (concl.). For the uniqueness, note that if x and y are two
solutions, then x ≡ aj ≡ y (mod mj ), that is, mj |(x − y) for all j.
Because the mj are pairwise relatively prime, we conclude
∏kj=1 mj (x − y).
Proof (concl.). For the uniqueness, note that if x and y are two
solutions, then x ≡ aj ≡ y (mod mj ), that is, mj |(x − y) for all j.
Because the mj are pairwise relatively prime, we conclude
∏kj=1 mj (x − y).
Example.
7 · 9 · y1 ≡ 1 (mod 5)
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7)
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
5 · 7 · y3 ≡ 1 (mod 9)
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
5 · 7 · y3 ≡ 1 (mod 9) y3 = 8
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
5 · 7 · y3 ≡ 1 (mod 9) y3 = 8
So x :=
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
5 · 7 · y3 ≡ 1 (mod 9) y3 = 8
So x := 1 · 63 · 2 + 4 · 45 · 5 + 2 · 35 · 8
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
5 · 7 · y3 ≡ 1 (mod 9) y3 = 8
So x := 1 · 63 · 2 + 4 · 45 · 5 + 2 · 35 · 8 = 126 + 900 + 560
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
5 · 7 · y3 ≡ 1 (mod 9) y3 = 8
So x := 1 · 63 · 2 + 4 · 45 · 5 + 2 · 35 · 8 = 126 + 900 + 560 =
1586
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
5 · 7 · y3 ≡ 1 (mod 9) y3 = 8
So x := 1 · 63 · 2 + 4 · 45 · 5 + 2 · 35 · 8 = 126 + 900 + 560 =
1586 ≡ 11 (mod 315)
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
5 · 7 · y3 ≡ 1 (mod 9) y3 = 8
So x := 1 · 63 · 2 + 4 · 45 · 5 + 2 · 35 · 8 = 126 + 900 + 560 =
1586 ≡ 11 (mod 315) is the solution.
7 · 9 · y1 ≡ 1 (mod 5) y1 = 2
5 · 9 · y2 ≡ 1 (mod 7) y2 = 5
5 · 7 · y3 ≡ 1 (mod 9) y3 = 8
So x := 1 · 63 · 2 + 4 · 45 · 5 + 2 · 35 · 8 = 126 + 900 + 560 =
1586 ≡ 11 (mod 315) is the solution.
Lemma.
Proof.
Lemma.
Proof.
Theorem.
Proof.