Back to Mathematical Olympiad
Difficulty: 3/102025 IOQM 2025 (Q24)

Find the greatest common divisor of and .

Options:

  • A.

    4

  • 3

  • C.

    6

  • D.

    5

Guide / Hint

Hint 1: Use the sum-of-digits divisibility rule to see if both numbers are divisible by 3. The sum for both is 21.

Hint 2: Since one number is odd and the other is even, the GCD must be odd.

Hint 3: Apply the Euclidean algorithm: divide the larger number by the smaller, and repeat with the remainders until you find the GCD.

Solution

Step 1: Let's check for small prime divisors using standard divisibility rules:

  • Sum of digits of . Since is divisible by but not by , is divisible by but not by .

  • Sum of digits of . Similarly, is divisible by but not by .

Step 2: Since is even and is odd, the greatest common divisor cannot be even.

Step 3: Use the Euclidean Algorithm or division to find :

Step 4: The last non-zero remainder is , so the greatest common divisor is .

Ready to track your progress and master these topics?

Create a free account
    2025 IOQM 2025 Q24 - Olympiad Math Olympiad Question | Leminno