0
$\begingroup$

I have two questions.

There is this mathematica code which includes a list of the form {a,b, number} where each sublist gave the number of steps in the euclidean algorithm for numbers a and b. the list contains 5050 sublists. without looking at the code, how would I know that there are 5050 sublists? I know that the max number of steps in the EA is 5 times the min digits of a and b. So does this imply that the number of minimum digits of a and b are 1010?

Secondly, for $b \leq a \leq 1000$ how can I find a and b values the require the most steps in the EA?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.