×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide

We want to prove that if a and b are both odd, and a b, then gcd(a, b) = gcd((a b)/2

Mathematical Structures for Computer Science | 7th Edition | ISBN: 9781429215107 | Authors: Judith L. Gersting ISBN: 9781429215107 256

Solution for problem 25 Chapter 2.3

Mathematical Structures for Computer Science | 7th Edition

  • Textbook Solutions
  • 2901 Step-by-step solutions solved by professors and subject experts
  • Get 24/7 help from StudySoup virtual teaching assistants
Mathematical Structures for Computer Science | 7th Edition | ISBN: 9781429215107 | Authors: Judith L. Gersting

Mathematical Structures for Computer Science | 7th Edition

4 5 1 332 Reviews
25
3
Problem 25

We want to prove that if a and b are both odd, and a b, then gcd(a, b) = gcd((a b)/2, b). If a and b are both odd and a b, then gcd(a, b) = gcd(a b, b) because, from the regular Euclidean algorithm, gcd(a, b) begins with a = qb + r, 0 r < b and gcd(a b, b) begins with a b = (q 1)b + r, 0 r < b. The next step in either case is to divide b by r, so the two final answers will be the same. Finish this proof by showing that gcd(a b, b) = gcd((a b)/2, b).

Step-by-Step Solution:
Step 1 of 3
Step 2 of 3

Chapter 2.3, Problem 25 is Solved
Step 3 of 3

Textbook: Mathematical Structures for Computer Science
Edition: 7
Author: Judith L. Gersting
ISBN: 9781429215107

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

We want to prove that if a and b are both odd, and a b, then gcd(a, b) = gcd((a b)/2

×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide
×
Reset your password