Remainders of Euclidean Algorithms
Not what you're looking for?
Let b = r_0, r_1, r_2, ... be the successive remainders in the Euclidean Algorithm applied to a and b. Show that every 2 steps reduces the remainder by at least one half. In other words, verify that r_{i+2} < (1/2)r_{i}, for every i = 0,1,2,.... Conclude that the Euclidean algorithm terminates in at most 2log_{2}(b) steps, where log_2 is the logarithm to the base 2.
In particular, show that the number of steps is at most seven times the number of digits of b. [Hint: What is the value of log_{2}(10)].
Purchase this Solution
Solution Summary
Remainders of a Euclidean algorithm are investigated. The response received a rating of "5/5" from the student who originally posted the question.
Solution Preview
Actually, I found better bounds than those stated in the exercise.
Hence ...
Purchase this Solution
Free BrainMass Quizzes
Probability Quiz
Some questions on probability
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Know Your Linear Equations
Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.