Gimnaziu - clasa a V-a 2014-2eu Aflarea cmmdc a două numere naturale se poate face si cu Algoritmul lui Euclid ( sec. III i.e.n. ) ; algoritmul constă in impărtiri succesive ( numite pași sau iterații ). Exemplu, pentru numerele 535 si 215 :

P1:   535 : 215 = 2  rest 105

P2:   215 : 105 = 2 rest 5

P3:   105 : 5  = 21 rest 0,

Între resturile obținute, ultimul diferit de 0 ( adică 5 in cazul nostru ) este cmmdc al numerelor date ( 535 si 215 ).

 Pentru aflarea cmmdc al numerelor a =#m si b = #n, cu ajutorul Algoritmului lui Euclid, este necesar un numar de pasi/iteratii egal cu ...   .

]]> 1.0000000 0.3333333 0 0 #i]]> <question><wirisCasSession><![CDATA[<session lang="en" version="2.0"><library closed="false"><mtext style="color:#ffc800" xml:lang="en">variables</mtext><group><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><apply><csymbol definitionURL="http://www.wiris.com/XML/csymbol">repeat</csymbol><mtable><mtr><mtd><mi>a</mi><mo>=</mo><mi>random</mi><mo>(</mo><mn>100</mn><mo>,</mo><mn>600</mn><mo>)</mo></mtd></mtr><mtr><mtd><mi>b</mi><mo>=</mo><mi>random</mi><mo>(</mo><mn>50</mn><mo>,</mo><mn>500</mn><mo>)</mo></mtd></mtr></mtable><mrow><mi>a</mi><mo>&gt;</mo><mi>b</mi></mrow></apply></math></input></command><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>m</mi><mo>=</mo><mi>a</mi></math></input></command><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>n</mi><mo>=</mo><mi>b</mi></math></input></command><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi><mo>=</mo><mn>0</mn></math></input></command><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><apply><csymbol definitionURL="http://www.wiris.com/XML/csymbol">while</csymbol><mrow><mi>b</mi><mo>≠</mo><mn>0</mn></mrow><mtable><mtr><mtd><mi>t</mi><mo>=</mo><mi>b</mi></mtd></mtr><mtr><mtd><mi>b</mi><mo>=</mo><mi>a</mi><mo> </mo><mi>mod</mi><mo> </mo><mi>b</mi></mtd></mtr><mtr><mtd><mi>a</mi><mo>=</mo><mi>t</mi></mtd></mtr><mtr><mtd><mi>i</mi><mo>=</mo><mi>i</mi><mo>+</mo><mn>1</mn></mtd></mtr></mtable></apply></math></input></command><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>s</mi><mo>=</mo><mi>a</mi></math></input></command><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"/></input></command></group></library><group><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>m</mi></math></input><output><math xmlns="http://www.w3.org/1998/Math/MathML"><mn>361</mn></math></output></command><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>n</mi></math></input><output><math xmlns="http://www.w3.org/1998/Math/MathML"><mn>164</mn></math></output></command><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>s</mi></math></input><output><math xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn></math></output></command><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>i</mi></math></input><output><math xmlns="http://www.w3.org/1998/Math/MathML"><mn>4</mn></math></output></command></group><group><command><input><math xmlns="http://www.w3.org/1998/Math/MathML"/></input></command></group></session>]]></wirisCasSession><correctAnswers><correctAnswer type="mathml"><![CDATA[<math xmlns="http://www.w3.org/1998/Math/MathML"><mo>#</mo><mi mathvariant="normal">i</mi></math>]]></correctAnswer></correctAnswers><assertions><assertion name="syntax_expression"/><assertion name="equivalent_symbolic"/></assertions><options><option name="tolerance">10^(-2)</option><option name="relative_tolerance">true</option><option name="precision">4</option><option name="implicit_times_operator">false</option><option name="times_operator">·</option><option name="imaginary_unit">i</option></options><localData><data name="inputField">inlineEditor</data><data name="gradeCompound">and</data><data name="gradeCompoundDistribution"></data><data name="casSession"/></localData></question>