Skip to main content
OlympiadHQ

Browse · MathNet

Print

Japan 2013 Initial Round

Japan 2013 number theory

Problem

Suppose the least common multiple of three positive integers , , is . What is the minimum possible value that the sum can take?
Solution
44 Since , if we take , , , then the least common multiple of , , is and we get .

Now let us show that is the desired minimum value. Assume that the least common multiple of , , is , and is satisfied. Then, at least one of , , must be a multiple of . By symmetry we may assume without loss of generality that one such number is . Since , we must have . Then, we see that , and among and , we must have a multiple of , a multiple of and a multiple of . By symmetry we may assume that is a multiple of . Then, since and , we see that can be a multiple neither of nor of . Therefore, we see that must be a multiple of . But then, we get , which shows that it is impossible to have , and this establishes the claim that is the desired minimum value.
Final answer
44

Techniques

Least common multiples (lcm)Factorization techniques