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

To find gcd(420, 66) using the binary GCD algorithm takes

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

Solution for problem 26 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 357 Reviews
29
1
Problem 26

To find gcd(420, 66) using the binary GCD algorithm takes the following steps (compare with Example 27). You can do these steps in your head! 420 66 Fact 1 Save the 2 factor to multiply at the end 210 33 Fact 2 105 33 Fact 3 36 33 Fact 2 18 33 Fact 2 9 33 Fact 3 [Because gcd(a, b) = gcd(b, a), it doesnt matter whether the larger number is first or second or whether the even number is first or second.] 9 12 Fact 2 9 6 Fact 2 9 3 Fact 3 3 3 Fact 3 0 3 One number is now 0, so the other number is a factor in the gcd, therefore gcd(420, 66) = 2*3 = 6 (the factor of 2 comes from the very first step).

Step-by-Step Solution:
Step 1 of 3

Math 1432 Section 15738 MWF 10-11am SEC 100 Dr. Melahat Almus almus@math.uh.edu http://www.math.uh.edu/~almus COURSE WEBSITE: http://www.math.uh.edu/~almus/1432_fall16.html and www.casa.uh.edu Visit CASA regularly for announcements and course material! Read the...

Step 2 of 3

Chapter 2.3, Problem 26 is Solved
Step 3 of 3

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

Since the solution to 26 from 2.3 chapter was answered, more than 213 students have viewed the full step-by-step answer. The full step-by-step solution to problem: 26 from chapter: 2.3 was answered by , our top Math solution expert on 01/18/18, 05:04PM. The answer to “To find gcd(420, 66) using the binary GCD algorithm takes the following steps (compare with Example 27). You can do these steps in your head! 420 66 Fact 1 Save the 2 factor to multiply at the end 210 33 Fact 2 105 33 Fact 3 36 33 Fact 2 18 33 Fact 2 9 33 Fact 3 [Because gcd(a, b) = gcd(b, a), it doesnt matter whether the larger number is first or second or whether the even number is first or second.] 9 12 Fact 2 9 6 Fact 2 9 3 Fact 3 3 3 Fact 3 0 3 One number is now 0, so the other number is a factor in the gcd, therefore gcd(420, 66) = 2*3 = 6 (the factor of 2 comes from the very first step).” is broken down into a number of easy to follow steps, and 134 words. Mathematical Structures for Computer Science was written by and is associated to the ISBN: 9781429215107. This textbook survival guide was created for the textbook: Mathematical Structures for Computer Science, edition: 7. This full solution covers the following key subjects: . This expansive textbook survival guide covers 41 chapters, and 1956 solutions.

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

To find gcd(420, 66) using the binary GCD algorithm takes

×
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