የቁጥር ችግር

እርምጃ በደረጃ

1. \gcd(15, 25)

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

2. 25 = 1 \times 15 + 10

   Divide 25 by 15: quotient 1, remainder 10.

3. 15 = 1 \times 10 + 5

   Divide 15 by 10: quotient 1, remainder 5.

4. 10 = 2 \times 5 + 0

   Divide 10 by 5: quotient 2, remainder 0.

5. \gcd(15, 25) = 5

   The last non-zero remainder is 5.

መልሱን አሳይ

\gcd(15, 25) = 5