Template:Euclidean algorithm steps/line: Difference between revisions

Revision as of 00:48, 30 November 2024

Revision as of 00:49, 30 November 2024

Line 19:

|formula=floor(r{{{n}}}/r{{#expr:{{{n}}}+1}})

|id=q{{#expr:{{{n}}}+2}}|type=plain

}} ; r_{{{n}}} = {{calculator

|formula=r{{{n}}}%r{{#expr:{{{n}}}+1}}

|id=r{{#expr:{{{n}}}+2}}

Line 27:

|formula=not(r{{#expr:{{{n}}}+2}})

|starthidden=1

|1=<br>Since {{math|1=r_{{{n}}} = 0}} the algorithm is finished. Thus '''{{math|1=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