ਕੋਈ ਵੀ ਗਣਿਤ ਸਮੱਸਿਆ ਹੱਲ ਕਰੋ

ਕਦਮ ਦਰ ਕਦਮ

1. \gcd(12, 18)

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

2. 18 = 1 \times 12 + 6

   Divide 18 by 12: quotient 1, remainder 6.

3. 12 = 2 \times 6 + 0

   Divide 12 by 6: quotient 2, remainder 0.

4. \gcd(12, 18) = 6

   The last non-zero remainder is 6.

ਜਵਾਬ ਦਿਓ

\gcd(12, 18) = 6