Question: Use the Euclidean algorithm to find a) gcd(12, 18). b) gcd(111, 201). c) gcd(1001, 1331). d) gcd(12345, 54321). e) gcd(1000, 5040). f) gcd(9888, 6060).
a) gcd(12, 18).
b) gcd(111, 201).
c) gcd(1001, 1331).
d) gcd(12345, 54321).
e) gcd(1000, 5040).
f) gcd(9888, 6060).
Step by Step Solution
3.44 Rating (157 Votes )
There are 3 Steps involved in it
a By Lemma 1 gcd12 18 is the same as the gcd of the smaller of these two numbers 12 and ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
923-M-C-M-S (1664).docx
120 KBs Word File
