Scribd
Upload
11 views12 pages

Lecture 8 MATH 212

Uploaded by

farhanmasih1903
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views12 pages

Lecture 8 MATH 212

Uploaded by

farhanmasih1903
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

1 MATH 212

Elementary Number Theory


Lecture 8
2 2.3 The Greatest Common Divisor
Review of Important Results
• gcd(a, b) = min{ax+by: ax+by > 0, x, y ∈ ℤ}
gcd(a, b) is the smallest positive integer linear combination of a and b.
• {ax+by: x, y ∈ ℤ} is precisely the set of all multiples of d = gcd(a, b).
• gcd(a, b)=1 if and only if there exist integers x and y such that ax+by =1.
[Bézout Identity]
• If a|c and b|c, with gcd(a, b) = 1, then ab|c.
• If a|bc, with gcd(a, b)=1, then a|c. [Euclid’s Lemma]
3 Problems 2.3
Q20. Confirm the following properties of the greatest common
divisor.
a) If gcd(a, b)=1 and gcd(a, c)=1, then gcd(a, bc)=1.
Solution:
Given gcd(a, b)=1 and gcd(a, c)=1, so by Bezout’s Identity there exist
integers x, y and u, v such that ax+by = 1 and au+cv = 1.
Now 1 = (ax+by)(au+cv) = a2xu+acxv+abyu+bcyv
= a(axu+cxv+byu)+bc(yv) = ar+(bc)s,
where r= axu+cxv+byu and s=yv are integers.
This implies gcd(a, bc)=1.
4 b) If gcd(a, b)=1 and c|a, then gcd(b, c)=1.
Solution:
Suppose gcd(a, b)=1.
Then there exist integers x and y such that ax+by=1.
Also, c|a implies a=ck, for some integer k.
Substituting in the above equation, we have
(kc)x+by = 1
Or c(kx)+by = 1
which implies gcd(b, c)=1.
5 c) If gcd(a, b)=1, then gcd(ac, b)= gcd(c, b).
Solution:
Let d1=gcd(c,b) and d2=gcd(ac,b).

Then, cx1+by1=d1 and acx2+by2=d2 for suitable integers x1,y1,x2,y2.

Also gcd(a, b)=1 implies ax+by=1 by Bezout Identity.

Multiply ax+by=1 by d1 we have, d1(ax+by) = d1

ax(cx1+by1)+bd1y = d1 (using d1=cx1+by1 at the first place on LHS)

⟹ ax(cx1+by1)+bd1y=d1 ⟹ ac(xx1)+b(axy1+d1y)=d1

Since we know that d2=gcd(ac,b) divides any integer linear


combination of ac and b, we have d2|d1.
6 Conversely, by a similar argument, multiply ax+by=1 by d2 we have

d2(ax+by)= d2

ax(acx2+by2)+bd2y = d2 (using d2=acx2+by2 in the first place on LHS)

⟹ c(a2xx2)+b(axy2+d2y)=d2

Since we know that d1=gcd(c,b) divides any integer linear


combination of c and b, we have d1|d2.
We have d1|d2 and d2|d1, and since both d1 and d2 are non-negative
(being the gcd of two integers), we conclude that d1=d2.
That is, gcd(ac,b) = gcd(c,b).
7 d) If gcd(a, b)=1, and c|a+b, then gcd(a, c)=gcd(b, c)=1.
Solution:
Suppose gcd(a, b)=1.
Then there exist integers x and y such that ax+by=1 - - - (1).
Also, c|(a+b) implies there exists integer k such that a+b=ck - - -(2)
From here b=ck – a, when substituted in the equation (1), gives
ax+(ck – a)y = 1.
Or a(x – y)+c(ky) = 1 which implies gcd(a, c)=1.
Again from (2), a=ck-b which when substituted in the equation (1),
gives (ck-b)x+by = 1. Or b(y – x)+c(kx) = 1 which implies gcd(b, c)=1.
Thus, gcd(a, c)=1= gcd(b, c).
8 e) If gcd(a, b)=1, and d|ac and d|bc, then d|c.
Solution:
Suppose gcd(a,b)=1, then by Bezout Identity
ax+by=1 for some integers x, y.
Multiplying both sides of this equation by c, we get
(ac)x+(bc)y=c - - - (1)
Since d|ac and d|bc, it follows that d|[(ac)x+(bc)y]
which in view of equation (1) means d|c.
9 e) If gcd(a, b)=1, then gcd(a2, b2)=1.
Solution:
Suppose gcd(a, b)=1, then there are integer x, y such that ax+by=1
Then ax+by(ax+by)=1
Or a(x+bxy)+b2y2=1
This means gcd(a, b2)=1
This again translates to ar+b2s=1, for some integers r and s.
Or ar(ar+b2s)+b2s=1
Or a2r2+b2(ars+s)=1
which means gcd(a2, b2)=1.
10
Q21. a) Prove that if d|n, then 2d – 1|2n – 1.
Solution:
Suppose d|n, then n=dk for some integer k.
Using the identity (xk – 1) = (x – 1)[xk-1+xk-2+…+x+1], we have
2n – 1 = 2dk – 1 = (2d)k – 1= (2d – 1)[(2d)k-1+(2d)k-2+…+(2d)+1]
which implies (2d – 1)|(2n – 1).
b) Verify that 235 – 1 is divisible by 31 and 127.
Solution:
We note 235 – 1 = (25)7 – 1= (25 – 1)[(25)7-1+(25)7-2+…+(25)+1]
= (31)[230 + 225 + 220 + 215+ 210 + 25 +1]
Also, 235 – 1 = (27)5 – 1 = (27 – 1)[(27)5-1+(27)5-2+…+(27)+1]
= (127)[228 + 221 + 214 + 27 +1]
Hence, 31 and 127 divides 235 – 1.
11 Q23. If a|bc show that a|gcd(a, b)gcd(a, c).
Solution:
Let d1=gcd(a, b) and d2=gcd(a, c).

Then there exist integers u, v and x, y such that


d1=au+bv and d2=ax+cy.
Now d1d2=(au+bv)(ax+cy) = a2ux+acuy+abvx+bcvy
= a(aux+cuy+bvx)+bc(vy)
If a|bc, then a|[a(aux+cuy+bvx)+bc(vy)]
so that a|d1d2.
This means a|gcd(a, b)∙gcd(a, c).
Practice Questions
Problems 2.3
Q 20 – 21, 23

12 THANK YOU

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy