(Choose 1 answer)
Given the Euclidean Algorithm
procedure gcd(a, b: positive integers)x:= a y:= b while (y is not 0)r:= x mod y x:= y y:= r return xx is gcd(a, b)}
If a=610 b=233. then before performing Step 3 of the loop the values of x and y are
A. x=144, y=55
B. x=89. y=55
C. x=144,y=89
D. x=233. y=89
E. None of the other choices is correct
Back
Next
vat
fini
\sum_{i=1}^{\infty}(1)^{i}
6
