SECTION 1 - Integers

Definition We will say that a divides b (written ab) if and only if there is an integer d such that ad = b
Exercise 1

Which integers divide zero?

Solution All integer divide zero.

Let d=0 then a0 since a 0 = 0 for all a

Exercise 2

Show that if a|b and b|c, then a| c.

Given a b d 1

Solution

ad 1 =b and b c d 2 bd 2 =c.

Then (ad 1 d 2 =c hence a(d 1 d 2 =c .

Let d = d 1 d 2 .

Lemma 1.

Then ad = c. Therefore a c.

If da and db,then d(a+b).

Proof From the definition of divides, we know that there are integers q and r such that dq = a and dr =
b.
Thus a + b = d(q + r), so from the definition again, d (a + b).
Lemma 2.

If da I , da 2 , . . . , da n , then d(c 1 a l +c 2 a 2 + ... +c n a n ) for any integers c 1 , c 2 , ... , c n .

Proof From the definition, there are integers q I , q 2 , .. ,q n such that a l = dq l , a 2 = dq 2 . . . , a n = dq n .

Thus c 1 a 1 + c 2 a 2 + . . . + c n a n = d(c 1 q 1 + c 2 q 2 + . . . + c n q n ,) , and from the definition again ,
dc 1 a 1 + c 2 a 2 + . . . + c n a n .

Exercise 3 Prove that if da then dca for any integer c.

Solution From the definition of divides m dm =a. Multiplying both sides of this equation by c gives
dmc =ac. Let q = mc. Since m,c

then q . So dq=ca hence d|ca for any integer c.

We say that d is the greatest common divisor of a and b (written d = (a,b) if and only if
(i) d|a and d|b, and
(ii) if c|a and c|b, then c d.
Exercise 4. What are (4, 14) , (5, 15) , and (6, 16)?
Solution

Solution (4, 14) = 2 , (5, 15) = 5 , and (6, 16) = 2

Exercise 5. What is (n , 1) , where n is any positive integer? What is (n,0)?

Solution (n , 1) = 1, (n,0) = n
Exercise 6. If d is a positive integer, what is (d, nd)?
Solution (d, nd) = d

Theorem 1.

If (a, b) = d, then (a/d, b/d) = 1.

Theorem 2.

The Division Algorithm.

Given positive integers a and b, b 0,. there exist unique integers q and r, with 0 r < b such
that a = bq + r .
Alt Proof:
If a is a multiple of b the theorem is at once verified, r being in this case 0.
If a is not a multiple of b it must lie between two consecutive multiples of b;
1

that is, there exists a q such that qb < a < (q + 1)b:

Hence there is an integer r, 0 < r < b, such that a = qb+r.
In case b is greater than a it is evident that q = 0 and r = a. Thus the proof of the theorem is
complete.
Exercise 7. What are q and r if a = 75 and b = 24? If a = 75 and b = 25?
75=324+3

75 = 325 +0

If a = b q + r, then (a, b) = ( b, r).

Lemma 3.

Proof Proof. Let d = (a, b). We know that since d|a and d|b , it follows from a =bq + r that d|r. Thus d is
a common divisor of b and r. Suppose that c is any common divisor of b and r. We know that c|b and
c|r, and it follows from a = bq + r that c|a. Thus c is a common divisor of a and b ,and hence c d.
Both parts of the definition of greatest common divisor are satisfied, and we have d = (b, r).
Exercise 8. Verify that the lemma is true when a = 16, b = 6, and q = 2.

Exercise

16=26+4

(16,6)=2=(6,4)

Theorem 3. The Euclidean Algorithm.

If a and b are positive integers,b 0, and
0 r < b,

a=bq+r,
b =rq 1 +r l ,

0 r1 < r

r =r l q 2 +r 2
...
r k =r k+1 q k+2 +r k+2
Exercise 9.

0 r2 < r1
...
0 r k+2 < r k+1

Calculate(343,280) and (578,442).

343=280 1 + 63
280=634 + 28

578 = 442 1 + 136

442 = 136 3 + 34

63=282 + 7

136 = 34 4 +0

28=74 + 0

gcd578, 442 = 34

gcd(343,280)= 7
Theorem 4.

If(a,b)=d, then there are integers x and y such that ax+by=d.

If (a, b) = 1, then we will say that a and b are relatively prime.

Corollary 1.

If d|ab and (d,a)=1, then d|b.

Proof Since d and a are relatively prime, we know from Theorem 4 that there are integers x and y such
that dx+ay=1. Multiplying this by b. we have d(bx)+(ab)y=b. The term d(bx) can of course be divided
by d, and so can (ab)y, since d divides ab. Thus d divides the left-hand side of the last equation and
hence divides the right-hand side too, which is what we wanted to prove.
Corollary 2.

Let (a,b)=d, and suppose that c|a and c|b. Then c|d.

Proof We know that there are integers x and y such that ax+by=d. Since c divides each term on the
left-hand side of this equation, c divides the right-hand side too.
2

Corollary 3.

If a|m, b|m, and (a,b)=1, then ab|m.

Proof There is an integer q such that m=bq, and since a|m we have a|bq, But (a,b)=1 , so Corollary 1
says that a|q. Hence there is an integer r such that q=ar, and thus m=bq=bar. That shows that ab|m.
PROBLEMS
Problem 1. Calculate (314,159) and (4144,7696).
Solution 314=159*1+155

4144=7696*0+4144

159=155*1+4

7696=4144*1+3552
4144=3552*1+592

155=4*38+3
4=3*1+ 1

3552=592*5+ 592
592=592*1+0

3=1*3+0
gcd(314,159)= 1. 0

gcd(4144,7696)= 592. 0

Problem 2. Calculate (3141,1592) and (10,001,100,083).

Solution 3141=1592*1+1549

100,083=10,001*10+73

1592=1549*1+43

10,001=73*13+52

1549=43*36+ 1

73=52*1+21

43=1*43+0

52=21*2+10

gcd(3141,1592)= 1

21=10*2 + 1
10=1*10+0
gcd10001, 1000083 = 1

Problem 3. Find x and y such that 314x+159y=1.

Problem 4. Find x and y such that 4144x+7696y=592.
Problem 5. If N=abc+1, prove that (N,a)=(N,b)=(N,c)=1.
Solution Let d=(N,a)

d|N and d|a d|abc

d|N abc d|1 d = 1

Let e=(N,b)

e|N and e|b e|abc

e|N abc e|1 e = 1

Let f=(N,c)

f|N and f|c f|abc

f|N abc f|1 f = 1

Thus d=e=f=1
(N,a)=(N,b)=(N,c)=1.
Problem 6. Find two different solutions of 299x+247y=13.
Problem 7. Prove that if a|b and b|a, then a=b or a=-b.
Solution a|b m am = b
Thus bnm = b and amn =a,

and b|a n bn = a
dividing by b and dividing by a
3

nm =1

n, m =1 or n,m = -1

a(1 = b
Problem 8. Prove that if a|b and a>0, then (a,b)=a.
Solution i) a|a and a|b
ii) let c be an arbitrary divisor of a and b. So c|a and c|b. Since the largest divisor of a>0 is a then
c a.
(a,b)=a.
Problem 9. Prove that ((a,b),b)=(a,b).
Solution Let d=(a,b). Thus d|d and d|b.
Let c|(a,b) and c|b

c|d c d.

((a,b),b)=(a,b)
Problem 10. (a) Prove that(n,n+1)=1 for all n>O.
(b) If n>0, what can (n,n+2) be?
Solution a)
i)

1|n and 1|(n+1)

ii)

let c be any divisor of n and (n+1).

cp=n and cq=n+1 so n = cq-1

cp=cq-1

p=q- 1c

Si nce p is an integer c=1

c1
Solution b) For n>0, (n,n+2) =1 or (n,n+2)=2
ex (1,3), (2,4),(3,5),(4,6)
Problem 11. (a) Prove that (k, n+k)=1 if and only if (k,n)=1.
(b) Is it true that (k, n+k)=d if and only if (k,n)=d?
Solution Assume (k, n+k)=1 1|k and 1|(n+k )

1|n + k k 1|n

1|k and 1 |n so 1 is a common divisor of k and n

??????????????

Problem 12. Prove: If a|b and c|d, then ac|bd.

Proof Assume a,b,c,d ar eintegers.
Given ab, m am = b and given cd n cn = d.
Thus bd = amcn.
Let k=mn. Since m,n are integers, k is also an integer.
So bd = ack and therefore, by definition acbd.
Problem 13. Prove: If d|a and d|b,then d 2 |ab.
Proof Assume a,b,d are integers.
Proof Given da, m dm = a and given db, n dn = b.
Thus ab =dmdn = ddmn = d 2 mn.
4

Let k=mn. Since m,n are integers, k is also an integer.

So ab=d 2 k and therefore, by definition d 2 |k.
Problem 14. Prove: If c|ab and(c,a)=d, then c|db.
Proof Assume a,b,c,d are integers.
Given (c,a)=d, there are integers x and y such that cx+ay=d bcx + bay = bd
Since c|(bx)c and c|ab c|y(ab), we conclude that c|bd.
Problem 15.(a) If x 2 +ax+b=0 has an integer root, show that it divides b.
Proof Assume a,b are integers.
Let r be an integer root of x 2 + ax + b = 0.
Thus r 2 + ar + b = 0 r(r+a) = -b.
Let k = r+a, so rk=-b. Hence, by definition of divides r|(-b) r|b.
Problem (b) If x 2 +ax+b=0 has a rational root,show that it is in fact an integer.