text: euclidean algorithm? what is the greatest number of steps in the  euclidean algorithm for the numbers 13,405 and 1,027?  a) 15  b) 20  c) 25  d) none of the above d  this is kind of a silly question -- the true number of steps is 3 13405 / 1027  1027 /   54    54 /    1     1 /    0  technically speaking, the euclidean algorithm is o(n) where n is # of digits in the input.