AMC 10 Step by Step

2018 AMC 10B Problem 14

P11-15~3 minPrint

A list of 20182018 positive integers has a unique mode, which occurs exactly 1010 times. What is the least number of distinct values that can occur in the list?

Log in to save your progress.
Show solution without answering

Key insight

The mode is the only value that appears 10 times, so every other value appears at most 9 times. Fill the other 2008 spots using as few values as possible.

Solution

We want as few different values as possible, so each value should be used as many times as the rules allow.

1. The mode's spots. The mode appears exactly 1010 times. That leaves 2018−10=20082018 - 10 = 2008 other spots.
2. The limit on other values. The mode is the only most common value, so every other value appears fewer than 1010 times, that is, at most 99 times.
3. Fewest other values. Each other value fills at most 99 spots. Divide:
2008÷9=223 remainder 1.2008 \div 9 = 223 \text{ remainder } 1.
So 223223 values fill 223×9=2007223 \times 9 = 2007 spots, and 11 spot is still empty. That needs one more value. So at least 224224 other values are needed.
4. It can be done. Use 223223 values that appear 99 times each, plus one more value that appears once. Together with the mode, that fills all 20182018 spots, and the mode is still the only value that appears 1010 times.
5. Count everything. 224224 other values plus the mode itself gives 224+1=225224 + 1 = 225.

The answer is (D) 225\boxed{\textbf{(D)}\ 225}.

Why this works

To use the fewest values, pack each value as full as the rules allow. The rule "unique mode" caps every other value at 99 uses. When the division leaves a remainder, you need one more value to cover it. And the question asks for all the values, so do not forget the mode.

Concise solution

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

The mode occupies 1010 of the 20182018 entries, leaving 20082008 entries to be filled by other values. Because the mode is unique, every other value appears at most 99 times.

To use as few distinct values as possible, make each of the other values appear as often as allowed, 99 times. Then the number of other values kk must satisfy 9k≥20089k \ge 2008, so
k≥20089=223.1…,k≥224.k \ge \frac{2008}{9} = 223.1\ldots, \qquad k \ge 224.
This is achievable: take 223223 values appearing 99 times each (20072007 entries) and one more value appearing once.

Including the mode, the minimum number of distinct values is 224+1=225224 + 1 = 225.

The answer is (D) 225\boxed{\textbf{(D)}\ 225}.

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.