Suppose we wish to compute the greatest common divisor of two 1000-digit numbers using
Chapter 39, Problem 39.7(choose chapter or problem)
Suppose we wish to compute the greatest common divisor of two 1000-digit numbers using Theorem 39.5. How many divisions would this take? (Assume we factor using trial division up to the square roots of the numbers.) How would this compare to using Euclids Algorithm?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer