Beruflich Dokumente
Kultur Dokumente
Sandeep Kumar
sandeep_kumar@sbs.du.ac.in
Introduction
1 / 10
Introduction
2 / 10
The integer 1 S.
Whenever k S = k + 1 S.
Introduction
3 / 10
Divisibility
Introduction
4 / 10
Introduction
5 / 10
Properties of GCD:
Introduction
6 / 10
Introduction
7 / 10
Division Algorithm:
Introduction
8 / 10
Euclids Algorithm
Suppose we have two positive integers a and b. Apply Division Algorithm
to get the sequence of ri0 s as:
a = bq1 + r1
0 r1 < b
b = r1 q2 + r2
0 r2 < r1
r1 = r2 q3 + r3
0 r3 < r2
..
.
rn2 = rn1 qn + rn
rn1 = rn qn+1 + rn+1
0 rn < rn1
0 rn+1 < rn
Introduction
9 / 10
Example:
For example let a = 26, b = 66. Then:
66 = 26 2 + 14
26 = 14 1 + 12
14 = 12 1 + 2
12 = 2 6 + 0
The last non zero remainder in the above process is 2, so gcd(26, 66) = 2.
Furhter more by goving backward we can write the gcd as linear
combinatino of 26 and 66.
2 = 14 12 1
= 14 (26 14 1) 1
= 14 2 26 1
= (66 26 2) 2 26 1
= 66 2 26 5
Sandeep Kumar (SBSC, DU)
Introduction
10 / 10