Theorem 1 if p is a prime and pjab then pja or pjb.

More generally if a prime

p divides a product a1 a2 :::an , then it must devide at least one of the factors
ai :Alternatively Theorem state if njab and gcd (n; a) = 1; then njb( more general
for any integers)

Proof. let a; b are integers and p is prime number, suppose pjab if pja we are
done. What if pja ? suppose we say p - a since p is prime we know the least
positive divisor of p are 1 and p it self, therby the greatest common divisor of
a and p are either 1 or p but, in the beginning we say p doesn’t divide a so
we have gcd (p; a) = 1: Thus, p and a are relatively prime. Since pjab and p - a
then we must have pjb:
Proof. suposse njab with the de…nition of divisibilty ab = nq where q 2 Z , and
then suppose gcd (a; n) = 1 , as bezout’s identity says gcd can be represented as
linear combination , therefore gcd (n; a) = ns + at = 1; subtitute a = nqb to the
equation we get ns + nq b t = 1 ) bns + nqt = b ) n (bs + qt) = b. consider
that bs + qt just a another integer which came from sum of product of integer,
thus let bs + qt = m so we must get nm = b , from de…nition of divisibilty we
conclude that njb hence we proved the theorem