Skip to main content
OlympiadHQ

Browse · MathNet

Print

75th Romanian Mathematical Olympiad

Romania algebra

Problem

Andrei represents as a sum of pairwise different positive integers. Find the lowest value that the largest of the numbers can achieve.
Solution
Let so that . Then , , , , . Consequently, . Then , hence . Since is a positive integer, it follows that . The value can be achieved: , therefore the required minimum is .
Final answer
71

Techniques

IntegersColoring schemes, extremal argumentsSums and productsLinear and quadratic inequalities