Four friends each pick a card and run Euclid's subtraction algorithm on the pair written on it. A reduction is one use of Step 3, ; reversing the numbers in Step 1 is not counted.
Whose card needs the most reductions?
Confirming your payment
Competency-Based Questions (CBQ) · Question 24 of 40
Four friends each pick a card and run Euclid's subtraction algorithm on the pair written on it. A reduction is one use of Step 3, ; reversing the numbers in Step 1 is not counted.
Whose card needs the most reductions?
(A)
(B)
(C)
(D)
Option (A) is correct.
Explanation:
Trace each card (problems written after any reversal):
The card with the smallest numbers needs the most work. For 89 and 55, at almost every stage the smaller number fits into the larger only once, so each reduction makes the numbers only a little smaller, and they come down slowly all the way to 1. You cannot tell the number of reductions from how big the numbers look; you have to run the algorithm.
Why the other options are wrong