list of remainder

lawrence shared this question 4 years ago

Answered

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)

initialisation i=1

i=i+1

r(i)=r(i-2) mod(r(i-1))

while r(i) is not=0

return k=r(i-1)

any help or suggestion is much appreciated. Thanks

Files: list of remaind...

The same question

Comments (5)

mathmagic ● 4 years ago

https://www.geogebra.org/m/DyVE8Fmn

Reply URL

Tang Dashi ● 4 years ago

a=162
b=12
l1={}

SetValue(l1,IterationList(Mod(p,q), p, q, {a,b}, b))

c=Min(KeepIf(x>0, l1))

Reply URL

lawrence ● 4 years ago

how to exclude first 2 numbers. , a and b (973,301) in set l1 which are not the remainders when a/b iteratively. Thanks

Files: make iteration...

URL

mathmagic ● 4 years ago

l1\{a,b}

Reply URL

lawrence ● 4 years ago

thanks so much!

URL