NUMBER THEORY

(HARD NUT TO
CRACK!!!!)

Caution : Only for NURDS!!!!!!!!

 Divisibility

 For integers a and b, we say that a

divides b, or that a is a divisor (or
factor) of b, or that b is a multiple
of a, if there exists an integer c
such that b = ca, and we denote
this by a|b.
 Divisibility

A positive integer p is a prime if



the only divisors ofp are 1 and p.

If pk|a and pk+1 does not divide a
where p is a prime, i.e. pk is the
highest power of p dividing a,
then we denote this by p ||a.
k
Useful Facts
The Division Algorithm
• If a, b > 0, and


For any positive integer a and

a | b, then a b. integer b, there exist unique

integers q and r such that b =qa +r
and r < a, with r = 0 iff a | b.
 • If a | b1, a | b2,  The Fundamental Theorem of
Arithmetic. Every integer greater
. . . , a | bn, then than 1 can be written uniquely in
the form
for any integers
c1, c2, . . . , cn,
 where the pi are distinct primes and
the ei are positive integers.
Useful Facts
 Theorem 1.3. (Euclid) There exist an infinite number
of primes.
 Proof. Suppose that there are a finite number of
primes, say p1, p2, . . . ,pn.
 Let N = p1p2 · · · pn + 1. By the fundamental theorem
of arithmetic,
 N is divisible by some prime p. This prime p must be
among the pi, since by
 assumption these are all the primes, but N is seen not
to be divisible by any of the pi, contradiction.
 GCD and LCM

The greatest common divisor of two positive integers a

and b is the greatest positive integer that divides both a
and b, which we denote by gcd (a, b),and similarly, the
lowest common multiple of a and b is the least positive 4
integer that is a multiple of both a and b, which we denote
by lcm(a, b).
We say that a and b are relatively prime if gcd (a, b) = 1.
For integers a1, a2,. . . , an, gcd (a1, a2, . . . , an) is the
greatest positive integer that divides all of
a1, a2, . . . , an, and lcm(a1, a2, . . . , an) is defined
similarly.
Useful Facts

• For all a, b,
gcd(a, b)
·lcm(a,b) = ab.
 Useful Facts
• For all a, b, and m,
gcd(ma,mb) = mgcd(a,b)and
lcm(ma,mb)=m lcm(a, b).
 Useful Facts
• If d | gcd(a, b), then

In particular, if d = gcd(a, b), then gcd(a/d, b/d) = 1;

that is, a/d and b/d are relatively prime.
Useful Facts

•If a | bc and gcd(a, c) = 1,

then a | b
Some Interesting Numbers

0
The golden ratio

1.618
The first perfect number

6
The beauty have no beauty

51
Hightest power of two

86
2
Lucky seven

400
0 1 2 3
400=7+7+7+7