×
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 4.3 - Problem 37e
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 4.3 - Problem 37e

×

# Use Exercise 36 to show that if a and b are posi­tive ISBN: 9780073383095 37

## Solution for problem 37E Chapter 4.3

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants Discrete Mathematics and Its Applications | 7th Edition

4 5 1 415 Reviews
23
4
Problem 37E

Problem 37E

Use Exercise 36 to show that if a and b are posi­tive integers, then gcd(2a- 1, 2b - 1) = 2gcd(a,b)-1. [Hint: Show that the remainders obtained when the Eu­clidean 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).]

Step-by-Step Solution:
Step 1 of 3

Week 1 and 2 of College Pre-algebra Life Saver notes! Order of operations Remember GEMDAS 1.G rouping 2.E xponents 3.M ultiply 4.D ivide 5.A dd 6.S ubtract NOTE: when multiplying, dividing, adding, and subtracting you do it as you are reading a book; you go left to right. Important things to remember!:  When there are parenthesis ( ) inside of brackets [ ] be sure to do the parenthesis inside of the brackets first. Ex: 35- [3+(9-7)-2] The first step of the problem would be what is in the parenthesis, so (9-7) then you can solve for what remains left in the larger bracket.  Don't be intimidated if you see fractions! Fractions just simply mean divide  | | aka absolute value is considered a grouping symbol  When you have to find

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. The answer to “Use Exercise 36 to show that if a and b are posi­tive integers, then gcd(2a- 1, 2b - 1) = 2gcd(a,b)-1. [Hint: Show that the remainders obtained when the Eu­clidean 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).]” is broken down into a number of easy to follow steps, and 61 words. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. The full step-by-step solution to problem: 37E from chapter: 4.3 was answered by , our top Math solution expert on 06/21/17, 07:45AM. Since the solution to 37E from 4.3 chapter was answered, more than 361 students have viewed the full step-by-step answer. This full solution covers the following key subjects: gcd, show, used, Algorithm, integers. This expansive textbook survival guide covers 101 chapters, and 4221 solutions.

Unlock Textbook Solution