Issolvi kwalunkwe problema matematika

Ekuazzjonijiet, derivattivi, integrali, matriċi, triangoli, primes, statistika, jew problema kelma l-tutur taqsam f'partijiet.

Number-Theory · Gcd-And-Lcm

Gcd(5, 12)

5,\ 12

Pass b'pass

  1. \gcd(5, 12)

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

  2. 12 = 2 \times 5 + 2

    Divide 12 by 5: quotient 2, remainder 2.

  3. 5 = 2 \times 2 + 1

    Divide 5 by 2: quotient 2, remainder 1.

  4. 2 = 2 \times 1 + 0

    Divide 2 by 1: quotient 2, remainder 0.

  5. \gcd(5, 12) = 1

    The last non-zero remainder is 1.

Jiżvelaw it-tweġiba
\gcd(5, 12) = 1