1.

Euclidean algorithm-

a , b I ,b 0 q ,r I , 0 r <|b|
s .t .a=q . b+ r
We say b divide a if r=0 and denote it by b|a (b is divisor of a) and denote
b doesnt divide a by

a|1

b a

a=1

a|b and b|a

a=b

n|0 all n I

m , n I a(m. b+n . c)

if a|b and a|c

Note r is always +ve integer

2. Greatest common divisor(GCD) or highest common factor (HCF)

c I , c >0 is called G . C . D . of a , b I if

a) c|a and c|b

b) all divisor of a and b are divisor of c
notation c=(a,b) = G.C.D of a,b
ex- G.C.D. of 60,-24 is 12(>0)
c) a, b are relatively prime/coprime if (a,b)=1
notion of GCD can be extended to polynomials and other commutative
rings.
Note G.C.D. is always +ve integer
3. Theorem if a, b are 2 integers (not being 0 together) then (a,b) exist
and we can find integer m0, n0 s.t.

( a , b ) =m0 . a+n 0 . b
It is obvious that m0 and n0 are both of different sign
Prove let S be set of all integer of form
Assume

c=m0 a+n 0 b

m. a+ n .b

is smallest +ve integer S.

x|m.a+n.b

We know x|a and x|b

m,n I

x|c

[i.e. all divisor of a and b is divisor of c]

Assume

y=m . a+n . b S

then by Euclidean theorem y=q.c+r where

0 r< c

m. a+n . b=q . c +r
m
( 0 a+n0 b )+r
m. a+n . b=q .
r=( mq . m0 ) a+ ( nq . n0 ) b
r S ( but 0 r < cc is smallest + ve integer S )

 r=0 so y=q . c i. e . c y y S
c|1. a+ 0.bc|. a+1. b

cacb
[c is divisor of a and b]
Hence by definition of G.C.D. c=(a,b)
Corollary: If a and b are relatively prime, we can find integers m and n
such that m.a+n.b = 1
4. Prime no. - an integer which has no nontrivial (other than 1 and itself)
factorization. 1 is excluded from prime no.
5. Theorem : if a is relatively prime to b and a|bc then a|c (i.e. If a prime
number divides the product of certain integers it must divide at least one
of these integers. )
Prove- We know (a,b)=1

m, n I s . t . m . a+n . b=1

m. a . c+ n .b . c=c
It is obvious that a|m.a.c and it is evident from given fact a|b.c that a|n.b.c

am. a . c+ n. b . c ac

6. Unique factorisation theorem Any positive integer a>1 can be

factored in a unique way as

a=p 1 . p 2 . . pt where p1> p 2> > pt are prime no . i N

1