Leysa hvaða stærðfræði vandamál

Jafnvægi, afleiður, heildar, fylki, þríhyrningar, frumtölur, tölfræði eða orðavandamálið sem kennarinn brýtur í sundur.

Number-Theory · Gcd-And-Lcm

Gcd(21, 14)

21,\ 14

Skref fyrir skref

  1. \gcd(21, 14)

    Use Euclid's algorithm: replace the larger number by its remainder on division by the smaller, until the remainder is 0.

  2. 21 = 1 \times 14 + 7

    Divide 21 by 14: quotient 1, remainder 7.

  3. 14 = 2 \times 7 + 0

    Divide 14 by 7: quotient 2, remainder 0.

  4. \gcd(21, 14) = 7

    The last non-zero remainder is 7.

Sýna svarið
\gcd(21, 14) = 7