Maths Olympiad Prep

Library / /669 of 860

Combinatorics Difficulty 5.3 AIME, harder Find the answer

Find all numbers nn with the following property: there is exactly one set of 8 different positive integers whose sum is nn.

A number or a short expression. Spacing and $ signs are ignored.

Solution

The sum of 8 different positive integers is at least 1+2+3++8=361+2+3+\cdots+8=36, so we must have n36n \geq 36. Now n=36n=36 satisfies the desired property, since in this case we must have equality - the eight numbers must be 1,,81, \ldots, 8. And if n=37n=37 the eight numbers must be 1,2,,7,91,2, \ldots, 7,9 : if the highest number is 8 then the sum is 36<n36<n, while if the highest number is more than 9 the sum is >1+2++7+9=37=n>1+2+\cdots+7+9=37=n. So the highest number must be 9 , and then the remaining numbers must be 1,2,,71,2, \ldots, 7. Thus n=37n=37 also has the desired property. However, no other values of nn work: if n>37n>37 then {1,2,3,,7,n28}\{1,2,3, \ldots, 7, n-28\} and {1,2,,6,8,n29}\{1,2, \ldots, 6,8, n-29\} are both sets of 8 distinct positive integers whose sum is nn. So n=36,37n=36,37 are the only solutions.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.