Ask your own question, for FREE!
Mathematics 11 Online
OpenStudy (anonymous):

It is known that 8 divisions are required when the euclidean algorithm is used for finding the greatest common divisor of the integers a and b, with a > b. find lower bounds for a and b.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!