Template:Euclidean algorithm steps/line: Difference between revisions

Revision as of 12:06, 12 November 2024

Revision as of 12:24, 12 November 2024

Line 3:

{{Calculator-hideifzero|formula=step{{#expr:{{{n}}}*2+1}}|starthidden=1|1=q_{{{n}}} = {{calculator|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}}|type=plain}}}}

{{Calculator-hideifzero|formula=or(stepifgreater(curstep,{{#expr:{{{n}}}*2}},step1,0),ifgreater(curstep,{{#expr:{{{n}}}*2+1}},1,0))|starthidden=1|1={{calculator label|style=cursor:pointer|class=cdx-button cdx-button--action-destructive|for=start|1=Reset}}}}{{Calculator-hideifzero|formula=stepifgreater(curstep,{{#expr:{{{n}}}*2}},1,0)|starthidden=1|1={{calculator label|style=cursor:pointer|class=cdx-button cdx-button--action-progressive|for=step{{#expr:{{{n}}}*2+1}}|1=Next &rarr;}}}}{{Calculator-hideifzero|formula=stepifgreater(curstep,{{#expr:{{{n}}}*2+1}},1,0)|starthidden=1|1={{calculator label|style=cursor:pointer|class=cdx-button cdx-button--action-progressive|for=step{{#expr:{{{n}}}*2+2}}|1=Next &rarr;}}}}</includeonly>