The greatest common divisor of two positive integers can be found by an algorithm that uses only subtractions, parity checks, and shifts of binary expansions, without using any divisions. The algorithm proceeds recursively using the following reduction:
(Note: Reverse the roles of a and b when necessary.) Exercises refer to this algorithm.
How many steps does this algorithm use to find (a, b) if a = (2n − (−1)n)/3 and b = 2(2n−1 − (−1)n−1)/3, when n is a positive integer?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.