Template:Euclidean algorithm steps/line: Difference between revisions

Content deleted Content added
use math template
No edit summary
Line 27:
|formula=not(r{{#expr:{{{n}}}+2}})
|starthidden=1
|1=<br>Since {{math|1=r<sub>{{{n}}}</sub>=0}} the algorithm is finished. Thus '''GCD( {{calculator|formula=x|type=plain}}, {{calculator|formula=y|type=plain}} ) = {{calculator|formula=ifequal(r{{#expr:{{{n}}}+1}},0,r0,r{{#expr:{{{n}}}+1}})|type=plain}}'''.
}}
}}{{calculator