AMC 10 Step by Step

2022 AMC 10B Problem 14

P11-15~4 minPrint

Suppose that SS is a subset of {1,2,3,…,25}\left\{ 1, 2, 3, \ldots , 25 \right\} such that the sum of any two (not necessarily distinct) elements of SS is never an element of S.S. What is the maximum number of elements SS may contain?

Log in to save your progress.
Show solution without answering

Key insight

The numbers 13 to 25 work, since every sum is at least 26. Pairing smaller numbers that add to the largest number shows 14 is impossible.

Solution

This asks for the most numbers possible, so there are two halves: find a set that works, then show nothing bigger can work.

Part 1: thirteen numbers is possible.

  1. Take the top half, 13,14,…,2513, 14, \ldots, 25. That is 1313 numbers.
  2. The smallest sum you can make is 13+13=2613 + 13 = 26, which is bigger than 2525. So no sum lands back in the set.

Part 2: fourteen numbers is impossible.

3. The largest number in the set limits what else can go in, so look at it first. Suppose the largest number is 2525.
4. Pair up the numbers below 2525 so that each pair adds to 2525:
1+24, 2+23, 3+22, …, 12+13.1{+}24,\ 2{+}23,\ 3{+}22,\ \ldots,\ 12{+}13.
That is 1212 pairs, and every number from 11 to 2424 is in exactly one pair.
5. The set cannot hold both numbers of a pair. For example, if it had 55 and 2020, then 5+20=255 + 20 = 25 would be in the set, which breaks the rule.
6. So below 2525 the set has at most one number from each of the 1212 pairs. Adding 2525 itself gives at most 12+1=1312 + 1 = 13 numbers.
7. If the largest number is even, say 2424, pair up 1+23,2+22,…,11+131{+}23, 2{+}22, \ldots, 11{+}13: that is 1111 pairs, and 1212 is left over. The set cannot contain 1212, because 12+12=2412 + 12 = 24. So there are at most 11+1=1211 + 1 = 12 numbers.
8. If the largest number is smaller than 2424, there are even fewer numbers below it, and the same pairing gives an even smaller limit.

Thirteen is possible and fourteen is not.

The answer is (B) 13\boxed{\textbf{(B)}\ 13}.

Why this works

For "how many numbers can you pick without breaking a rule" questions, look at one special number (here the largest) and see what it forbids. Pairing the other numbers so each pair "competes" for one place turns the question into counting pairs. The words "not necessarily distinct" matter: they are why half of an even largest number is not allowed.

Alternative approach

The odd numbers 1,3,5,…,251, 3, 5, \ldots, 25 also make a set of 1313 that works, because odd plus odd is always even. Finding two different sets of 1313 and no set of 1414 is a good sign, but only the pairing argument proves that 1414 is impossible.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Construction. Take S={13,14,…,25}S = \{13, 14, \dots, 25\}, which has 1313 elements. The smallest possible sum of two elements is 13+13=26>2513 + 13 = 26 > 25, so no sum lands in SS.

Upper bound. Let MM be the largest element of SS. Every other element lies in {1,…,M−1}\{1, \dots, M-1\}. Group these numbers into pairs {k,M−k}\{k, M-k\} with k<M−kk < M - k. If both members of a pair were in SS, their sum MM would be in SS, forbidden. Also, if MM is even, the number M/2M/2 cannot be in SS, since M/2+M/2=MM/2 + M/2 = M.

  • If MM is odd, {1,…,M−1}\{1, \dots, M-1\} splits into M−12\frac{M-1}{2} pairs, each contributing at most one element, so ∣S∣≤M−12+1=M+12≤262=13|S| \le \frac{M-1}{2} + 1 = \frac{M+1}{2} \le \frac{26}{2} = 13.
  • If MM is even, there are M−22\frac{M-2}{2} pairs plus the excluded M/2M/2, so ∣S∣≤M−22+1=M2≤12|S| \le \frac{M-2}{2} + 1 = \frac{M}{2} \le 12.

Either way ∣S∣≤13|S| \le 13, and 1313 is achieved.

The answer is (B) 13\boxed{\textbf{(B)}\ 13}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.