Browse · MathNet
PrintJapan Mathematical Olympiad
Japan algebra
Problem
Let be the distinct integers lying in between and (both and inclusive). Let be the maximum of the three numbers , and . Determine the minimum value the number can take.
Solution
Let us write , and . We first show that it is possible to make the maximum of the three numbers to be no more than . Indeed, if we consider the following, we see that this is possible: Next, we will show that the maximum of the three numbers must be at least . Since all the numbers lie in between and and are distinct, we see that the product of the three numbers must be a constant, which from the example above must equal . In particular, we have . Thus the maximum of must be greater than . Since cannot be written as a product of integers lying in between through , we see that it is impossible to have any of to be . Therefore, the maximum of has to be at least .
Final answer
72
Techniques
IntegersCombinatorial optimizationColoring schemes, extremal arguments