Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory senior

Problem

If the least common multiple of two 6-digit integers has 10 digits, then their greatest common divisor has at most how many digits?
Solution
Call the two integers and . Recall that the product of two numbers' LCM and GCD is equal to the product of the two numbers themselves: This can be rearranged to give In this case, we know that and , so . We also know that , since the smallest 10-digit number is .

Therefore, so has at most digits.

(We should check that there are actual integers and for which has digits. There are; for example, we can take and , in which case the least common multiple is and the greatest common divisor is .)
Final answer
3