list of remainder
need to know how get list of all remainders when a divides b ( using euclidean algorithm) until remainder equals zero and return last non zero remainder.
by transalating the below statement to geogebra statements.
Input r(0) ,r(1) where r(0)>r(1)
while r(i) is not=0
any help or suggestion is much appreciated. Thanks