I-ScrabbleName

Ii-equations, i-derivates, i-integrals, i-matrices, i-triangles, i-primes, i-statistics, okanye ingxaki yegama umfundi ophula iinkalo.

Number-Theory · Gcd-And-Lcm

Gcd(1071, 462)

1071,\ 462

Inyathelo ngenyathelo

  1. \gcd(1071, 462)

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

  2. 1071 = 2 \times 462 + 147

    Divide 1071 by 462: quotient 2, remainder 147.

  3. 462 = 3 \times 147 + 21

    Divide 462 by 147: quotient 3, remainder 21.

  4. 147 = 7 \times 21 + 0

    Divide 147 by 21: quotient 7, remainder 0.

  5. \gcd(1071, 462) = 21

    The last non-zero remainder is 21.

Bonisa impendulo
\gcd(1071, 462) = 21