Use Exercise 36 to show that if a and b are positive
Chapter 4, Problem 37E(choose chapter or problem)
Problem 37E
Use Exercise 36 to show that if a and b are positive integers, then gcd(2a- 1, 2b - 1) = 2gcd(a,b)-1. [Hint: Show that the remainders obtained when the Euclidean algorithm is used to compute gcd(2a -1, 2b-1) are of the form 2r - 1. where r is a remainder arising when the Euclidean algorithm is used to find gcd(a, b).]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer