Template:Euclidean algorithm steps/line: Difference between revisions

Content deleted Content added
try something
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|style=background-color: hsl(55,100%,70%,var(--calculator-colorstep{{#expr:{{{n}}}*2-1}}))}} = q<sub>{{{n}}}</sub> × {{calculator|formula=r{{#expr:{{{n}}}+1}}|type=plain|style=background-color: hsl(55,100%,70%,var(--calculator-colorstep{{#expr:{{{n}}}*2}}))}} + 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=ifequal(r{{#expr:{{{n}}}+1}},0,r0,r{{#expr:{{{n}}}+1}})|type=plain}}'''.}}}}{{calculator|type=hidden|id=colorstep{{{n}}}|formula=ifequal(curstep,{{{n}}}*2,255,0)}}
{{calculator|type=hidden|id=colorstep{{{n}}}|formula=ifequal(curstep,{{{n}}}*2+1,255,0)}}
</includeonly>