1. Math
  2. Advanced Math
  3. problem 2 a using the euclidean algorithm show that ged12...

Question: problem 2 a using the euclidean algorithm show that ged12...

Question details

Problem 2. a. Using the Euclidean Algorithm, show that ged(12, 8)-4 b. Let c 1111111111111 (twelve 1s) and d 11111111 (eight 1s). Using the Euclidean Algorithm show that gcd(c, d) = 1111 (four ls). c. Above we have a 12 and b 8 with c- (102-1)/9 (twelve 1s) and d (l 0 -1)/9 (eight 1s) yields ged(a Por 4 pairs (a.b) of integers (of your choice or random) demonstrate the above holtds (gyou may use teeimology to compute the gcds) - 1)/9 (four 1s) where 4 d. (Bomus) Show that if c (10 -1)/9 and d (10b - 1)/9, then ged(c, d) (109 - 1)/9 where g ged(a, b) That is, c has a ls and d has b 1s, then ged(c, d) is the mumber with gcd(a, b) 1s
Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution