Content deleted Content added
No edit summary |
No edit summary |
||
Line 1:
<includeonly><!-- Note: The calculator r_x are two ahead of the text r_x -->
{{Calculator-hideifzero|formula=ifgreaterorequal(curstep,{{#expr:{{{n}}}*2}},1,0)|starthidden=1|1={{#ifeq:{{{n}}}|0||<hr>}}{{calculator|formula=r{{{n}}}|type=plain}} = q<sub>{{{n}}}</sub> × {{calculator|formula=r{{#expr:{{{n}}}+1}}|type=plain}} + r<sub>{{{n}}}</sub><br>}}
{{Calculator-hideifzero|formula=ifgreaterorequal(curstep,{{#expr:{{{n}}}*2+1}},1,0)|starthidden=1|1=q<sub>{{{n}}}</sub> = {{calculator|formula=floor(r{{{n}}}/r{{#expr:{{{n}}}+1}})|id=q{{#expr:{{{n}}}+2}}|type=plain}} ; r<sub>{{{n}}}</sub> = {{calculator|formula=r{{{n}}}%r{{#expr:{{{n}}}+1}}|id=r{{#expr:{{{n}}}+2}}|type=plain}}{{calculator-hideifzero|formula=not(r{{#expr:{{{n}}}+2}})|starthidden=1|1=<br>Since r<sub>{{{n}}}</sub>=0 the algorithm is finished. Thus '''GCD( {{calculator|formula=x|type=plain}}, {{calculator|formula=y|type=plain}} ) = {{calculator|formula=r{{#expr:{{{n}}}+1}}|type=plain}}'''.}}}}
{{Calculator-hideifzero|formula=or(step{{#expr:{{{n}}}*2}},step{{#expr:{{{n}}}*2+1}})|starthidden=1|1={{calculator label|style=cursor:pointer|class=cdx-button cdx-button--action-destructive|for=start|1=Restart}}}} {{Calculator-hideifzero|formula=step{{#expr:{{{n}}}*2}}|starthidden=1|1={{calculator label|style=cursor:pointer|class=cdx-button cdx-button--action-progressive|for=step{{#expr:{{{n}}}*2+1}}|1=Next →}}}}{{Calculator-hideifzero|formula=and(step{{#expr:{{{n}}}*2+1}},r{{#expr:{{{n}}}+2}})|starthidden=1|1={{calculator label|style=cursor:pointer|class=cdx-button cdx-button--action-progressive|for=step{{#expr:{{{n}}}*2+2}}|1=Next →}}}}</includeonly>
| |||