Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory senior

Problem

Let be an integer and let . Find the smallest value of such that for every partition of into two subsets, at least one of the subsets contains integers , , and (not necessarily distinct) such that .
Solution
We claim that is the minimal value of . Let the two partitioned sets be and ; we will try to partition and such that the condition is not satisfied. Without loss of generality, we place in . Then must be placed in , so must be placed in , and must be placed in . Then cannot be placed in any set, so we know is less than or equal to . For , we can partition into and , and in neither set are there values where (since and ). Thus .
Final answer
243