basic number theory
DESCRIPTION
Basic Number Theory. Agenda. Section 2.3 Divisors Primality Division Algorithm Greatest common divisors/least common multiples Relative Primality Modular arithmetic. Importance of Number Theory. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/1.jpg)
Basic Number Theory
![Page 2: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/2.jpg)
L9 2
AgendaSection 2.3
Divisors Primality Division Algorithm Greatest common divisors/least common
multiples Relative Primality Modular arithmetic
![Page 3: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/3.jpg)
L9 3
Importance of Number Theory
The encryption algorithms depend heavily on modular arithmetic. We need to develop various machinery (notations and techniques) for manipulating numbers before can describe algorithms in a natural fashion.
First we start with divisors.
![Page 4: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/4.jpg)
L9 4
DivisorsDEF: Let a, b and c be integers such that
a = b ·c .Then b and c are said to divide (or are
factors) of a, while a is said to be a multiple of b (as well as of c). The pipe symbol “|” denotes “divides” so the situation is summarized by:
b | a c | a .
![Page 5: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/5.jpg)
L9 5
Divisors.Examples
Q: Which of the following is true?1. 77 | 72. 7 | 773. 24 | 244. 0 | 245. 24 | 0
![Page 6: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/6.jpg)
L9 6
Divisors.Examples
A: 1. 77 | 7: false bigger number can’t
divide smaller positive number2. 7 | 77: true because 77 = 7 · 113. 24 | 24: true because 24 = 24 · 14. 0 | 24: false, only 0 is divisible by 05. 24 | 0: true, 0 is divisible by every
number (0 = 24 · 0)
![Page 7: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/7.jpg)
L9 7
Formula for Number of Multiples up to given n
Q: How many positive multiples of 15 are less than 100?
![Page 8: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/8.jpg)
L9 8
Formula for Number of Multiples up to given n
A: Just list them:15, 30, 45, 60, 75, 90.Therefore the answer is 6.
Q: How many positive multiples of 15 are less than 1,000,000?
![Page 9: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/9.jpg)
L9 9
Formula for Number of Multiples up to Given n
A: Listing is too much of a hassle. Since 1 out of 15 numbers is a multiple of 15, if 1,000,000 were were divisible by 15, answer would be exactly 1,000,000/15. However, since 1,000,000 isn’t divisible by 15, need to round down to the highest multiple of 15 less than 1,000,000 so answer is 1,000,000/15.
In general: The number of d-multiples less than N is given by:
|{m Z+ | d |m and m N }| = N/d
![Page 10: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/10.jpg)
L9 10
Divisor Theorem
THM: Let a, b, and c be integers. Then:
1. a|b a|c a|(b + c )2. a|b a|bc
3. a|b b|c a|cEG:
1. 17|34 17|170 17|2042. 17|34 17|340
3. 6|12 12|144 6 | 144
![Page 11: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/11.jpg)
L9 11
Divisor Theorem.Proof of no. 2
In general, such statements are proved by starting from the definitions and manipulating to get the desired results.
EG. Proof of no. 2 (a|b a|bc ):Suppose a|b. By definition, there is a
number m such that b = am. Multiply both sides by c to get bc = amc = a (mc ). Consequently, bc has been expressed as a times the integer mc so by definition of “|”, a|bc �
![Page 12: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/12.jpg)
L9 12
Prime Numbers
DEF: A number n 2 prime if it is only divisible by 1 and itself. A number n 2 which isn’t prime is called composite.
Q: Which of the following are prime?0,1,2,3,4,5,6,7,8,9,10
![Page 13: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/13.jpg)
L9 13
Prime NumbersA: 0, and 1 not prime since not positive and
greater or equal to 22 is prime as 1 and 2 are only factors3 is prime as 1 and 3 are only factors.4,6,8,10 not prime as non-trivially divisible by 2.5, 7 prime.9 = 3 · 3 not prime.
Last example shows that not all odd numbers are prime.
![Page 14: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/14.jpg)
L9 14
Fundamental Theorem of Arithmetic
THM: Any number n 2 is expressible as as a unique product of 1 or more prime numbers.
Note: prime numbers are considered to be “products” of 1 prime.
We’ll need induction and some more number theory tools to prove this.
Q: Express each of the following number as a product of primes: 22, 100, 12, 17
![Page 15: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/15.jpg)
L9 15
Fundamental Theorem of Arithmetic
A: 22 = 2·11, 100 = 2·2·5·5, 12 = 2·2·3, 17 = 17Convention: Want 1 to also be
expressible as a product of primes. To do this we define 1 to be the “empty product”. Just as the sum of nothing is by convention 0, the product of nothing is by convention 1.
![Page 16: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/16.jpg)
L9 16
Primality TestingPrime numbers are very important in
encryption schemes. Essential to be able to verify if a number is prime or not. It turns out that this is quite a difficult problem.
LEMMA: If n is a composite, then its smallest prime factor is
n
![Page 17: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/17.jpg)
L9 17
Primality Testing.Example
EG: Test if 139 and 143 are prime.List all primes up to and check if they divide the
numbers.2: Neither is even3: Sum of digits trick: 1+3+9 = 13, 1+4+3 = 8 so
neither divisible by 35: Don’t end in 0 or 57: 140 divisible by 7 so neither div. by 711: Alternating sum trick: 1-3+9 = 7 so 139 not div. By
11. 1-4+3 = 0 so 143 is divisible by 11.STOP! Next prime 13 need not be examined since
bigger than .Conclude: 139 is prime, 143 is composite.
n
n
![Page 18: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/18.jpg)
L9 18
Division
Remember long division?
117 = 31·3 + 24a = dq + r
311731
24
93
q the quotien
t
r the remainde
r
d the divisor
a the dividen
d
![Page 19: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/19.jpg)
L9 19
Division
THM: Let a be an integer, and d be a positive integer. There are unique integers q, r with r {0,1,2,…,d-1} satisfying
a = dq + rThe proof is a simple application of long-
division. The theorem is called the division algorithm.
![Page 20: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/20.jpg)
L9 20
mod function Start Here
A: Compute1. 113 mod 24:
2. -29 mod 7
11324
6
![Page 21: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/21.jpg)
L9 21
mod function
A: Compute1. 113 mod 24:
2. -29 mod 7
411324
17
96
![Page 22: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/22.jpg)
L9 22
mod function
A: Compute1. 113 mod 24:
2. -29 mod 7
411324
17
96
297
![Page 23: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/23.jpg)
L9 23
mod function
A: Compute1. 113 mod 24:
2. -29 mod 7
411324
17
96
5297
356
![Page 24: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/24.jpg)
Example of the Reminder’s Application:
What time would it be in 700 hours from now ?
Time=(current time + 700) mod 24
L9 24
![Page 25: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/25.jpg)
mod Arithmetic: congruent
THM: let a and b be integers and let m be positive integer. we say that a is ‘congruent ‘ to b mod m, given by:
a Ξ b (mod m) if and only if a mod m= b mod mEX: 8 Ξ 38 (mod 5)
L9 25
![Page 26: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/26.jpg)
L9 26
Greatest Common DivisorRelatively Prime
DEF Let a,b be integers, not both zero. The greatest common divisor of a and b (or gcd(a,b) ) is the biggest number d which divides both a and b.
Equivalently: gcd(a,b) is smallest number which divisibly by any x dividing both a and b.
DEF: a and b are said to be relatively prime if gcd(a,b) = 1, so no prime common divisors.
![Page 27: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/27.jpg)
L9 27
Greatest Common DivisorRelatively Prime
Q: Find the following gcd’s:1. gcd(11,77)2. gcd(33,77)3. gcd(24,36)4. gcd(24,25)
![Page 28: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/28.jpg)
L9 28
Greatest Common DivisorRelatively Prime
A:1. gcd(11,77) = 112. gcd(33,77) = 113. gcd(24,36) = 124. gcd(24,25) = 1. Therefore 24 and 25
are relatively prime.NOTE: A prime number is relatively prime
to all other numbers which it doesn’t divide.
![Page 29: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/29.jpg)
L9 29
Greatest Common DivisorRelatively Prime
EG: More realistic. Find gcd(98,420). Find prime decomposition of each number
and find all the common factors:98 = 2·49 = 2·7·7420 = 2·210 = 2·2·105 = 2·2·3·35
= 2·2·3·5·7Underline common factors: 2·7·7, 2·2·3·5·7Therefore, gcd(98,420) = 14
![Page 30: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/30.jpg)
L9 30
Greatest Common DivisorRelatively Prime
Pairwise relatively prime: the numbers a, b, c, d, … are said to be pairwise relatively prime if any two distinct numbers in the list are relatively prime.
Q: Find a maximal pairwise relatively prime subset of
{ 44, 28, 21, 15, 169, 17 }
![Page 31: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/31.jpg)
L9 31
Greatest Common DivisorRelatively Prime
A: A maximal pairwise relatively prime subset of {44, 28, 21, 15, 169, 17} :
{17, 169, 28, 15} is one answer.{17, 169, 44, 15} is another answer.
![Page 32: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/32.jpg)
L9 32
Least Common MultipleDEF: The least common multiple of a,
and b (lcm(a,b) ) is the smallest number m which is divisible by both a and b.
Equivalently: lcm(a,b) is biggest number which divides any x divisible by both a and b
Q: Find the lcm’s:1. lcm(10,100)2. lcm(7,5)3. lcm(9,21)
![Page 33: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/33.jpg)
L9 33
Least Common Multiple
A:1. lcm(10,100) = 1002. lcm(7,5) = 353. lcm(9,21) = 63
THM: lcm(a,b) = ab / gcd(a,b)
![Page 34: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/34.jpg)
L11 34
Euclidean Algorithm.Example
gcd(33,77):
Step r = x mod y x y
0 - 33 77
![Page 35: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/35.jpg)
L11 35
Euclidean Algorithm.Example
gcd(33,77):
Step r = x mod y x y
0 - 33 77
133 mod 77
= 3377 33
![Page 36: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/36.jpg)
L11 36
Euclidean Algorithm.Example
gcd(33,77):
Step r = x mod y x y
0 - 33 77
133 mod 77
= 3377 33
277 mod 33
= 1133 11
![Page 37: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/37.jpg)
L11 37
Euclidean Algorithm.Example
gcd(33,77):
Step r = x mod y x y
0 - 33 77
133 mod 77
= 3377 33
277 mod 33
= 1133 11
333 mod 11
= 011 0
![Page 38: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/38.jpg)
L11 38
Euclidean Algorithm.Example
gcd(244,117):
Step r = x mod y x y
0 - 244 117
![Page 39: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/39.jpg)
L11 39
Euclidean Algorithm.Example
gcd(244,117):
Step r = x mod y x y
0 - 244 117
1244 mod 117 =
10117 10
![Page 40: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/40.jpg)
L11 40
Euclidean Algorithm.Example
gcd(244,117):
Step r = x mod y x y
0 - 244 117
1244 mod 117 =
10117 10
2 117 mod 10 = 7 10 7
![Page 41: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/41.jpg)
L11 41
Euclidean Algorithm.Example
gcd(244,117):
Step r = x mod y x y
0 - 244 117
1244 mod 117 =
10117 10
2 117 mod 10 = 7 10 7
3 10 mod 7 = 3 7 3
![Page 42: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/42.jpg)
L11 42
Euclidean Algorithm.Example
gcd(244,117):
Step r = x mod y x y
0 - 244 117
1244 mod 117 =
10117 10
2 117 mod 10 = 7 10 7
3 10 mod 7 = 3 7 3
4 7 mod 3 = 1 3 1
![Page 43: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/43.jpg)
L11 43
Euclidean Algorithm.Example
gcd(244,117):
By definition 244 and 117 are rel. prime.
Step r = x mod y x y
0 - 244 117
1244 mod 117 =
10117 10
2 117 mod 10 = 7 10 7
3 10 mod 7 = 3 7 3
4 7 mod 3 = 1 3 1
5 3 mod 1=0 1 0
![Page 44: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/44.jpg)
L13 44
Modular Inverses if we have time left
gcd(33,77)
Step x = qy + r x y gcd = ax+by
0 -33
77
![Page 45: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/45.jpg)
L13 45
Extended Euclidean AlgorithmExamples
gcd(33,77)
Step x = qy + r x y gcd = ax+by
0 -33
77
133=0·77+
3377
33
![Page 46: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/46.jpg)
L13 46
Extended Euclidean AlgorithmExamples
gcd(33,77)
Step x = qy + r x y gcd = ax+by
0 -33
77
133=0·77+
3377
33
277=2·33+
1133
11
![Page 47: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/47.jpg)
L13 47
Extended Euclidean AlgorithmExamples
gcd(33,77)
Step x = qy + r x y gcd = ax+by
0 -33
77
133=0·77+
3377
33
277=2·33+
1133
11
333=3·11+
011
0
![Page 48: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/48.jpg)
L13 48
Extended Euclidean AlgorithmExamples
gcd(33,77)
Step x = qy + r x y gcd = ax+by
0 -33
77
133=0·77+
3377
33
277=2·33+
1133
11
333=3·11+
011
0Solve for r. Plug it
in.
![Page 49: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/49.jpg)
L13 49
Extended Euclidean AlgorithmExamples
gcd(33,77)
Step x = qy + r x y gcd = ax+by
0 -33
77
133=0·77+
3377
33
277=2·33+
1133
11
11 = 77 - 2·33
333=3·11+
011
0Solve for r. Plug it
in.
![Page 50: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/50.jpg)
L13 50
Extended Euclidean AlgorithmExamples
gcd(33,77)
Therefore s = -2 and t = 1
Step x = qy + r x y gcd = ax+by
0 -33
77
133=0·77+
3377
33
11= 77 - 2·(33-0·77)
= -2·33 + 1·77
277=2·33+
1133
11
11 = 77 - 2·33
333=3·11+
011
0Solve for r. Plug it
in.
![Page 51: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/51.jpg)
L13 51
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
![Page 52: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/52.jpg)
L13 52
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
10
![Page 53: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/53.jpg)
L13 53
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
10
2 117=11·10+7 10 7
![Page 54: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/54.jpg)
L13 54
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
10
2 117=11·10+7 10 7
3 10=7+3 7 3
![Page 55: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/55.jpg)
L13 55
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
10
2 117=11·10+7 10 7
3 10=7+3 7 3
4 7=2·3+1 3 1
![Page 56: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/56.jpg)
L13 56
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
10
2 117=11·10+7 10 7
3 10=7+3 7 3
4 7=2·3+1 3 1
5 3=3·1+0 1 0
![Page 57: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/57.jpg)
L13 57
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
10
2 117=11·10+7 10 7
3 10=7+3 7 3
4 7=2·3+1 3 1 1=7-2·3
5 3=3·1+0 1 0 Solve for r. Plug it in.
![Page 58: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/58.jpg)
L13 58
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
10
2 117=11·10+7 10 7
3 10=7+3 7 31=7-2·(10-7)= -2·10+3·7
4 7=2·3+1 3 1 1=7-2·3
5 3=3·1+0 1 0 Solve for r. Plug it in.
![Page 59: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/59.jpg)
L13 59
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
10
2 117=11·10+7 10 7
1=-2·10+3·(117-11·10)= 3·117-35·10
3 10=7+3 7 31=7-2·(10-7)= -2·10+3·7
4 7=2·3+1 3 1 1=7-2·3
5 3=3·1+0 1 0 Solve for r. Plug it in.
![Page 60: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/60.jpg)
L13 60
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
101= 3·117-35·(244-
2·117)
= -35·244+73·117
2 117=11·10+7 10 7
1=-2·10+3·(117-11·10)= 3·117-35·10
3 10=7+3 7 31=7-2·(10-7)= -2·10+3·7
4 7=2·3+1 3 1 1=7-2·3
5 3=3·1+0 1 0 Solve for r. Plug it in.
![Page 61: Basic Number Theory](https://reader035.vdocuments.net/reader035/viewer/2022062217/568132a6550346895d994744/html5/thumbnails/61.jpg)
L13 61
Extended Euclidean AlgorithmExamples
gcd(244,117):Step x = qy + r x y gcd = ax+by
0 -244
117
1 244=2·117+10
117
101= 3·117-35·(244-
2·117)
= -35·244+73·117
2 117=11·10+7 10 7
1=-2·10+3·(117-11·10)= 3·117-35·10
3 10=7+3 7 31=7-2·(10-7)= -2·10+3·7
4 7=2·3+1 3 1 1=7-2·3
5 3=3·1+0 1 0 Solve for r. Plug it in.
inverse of 244modulo 117