Difference between revisions of "2018 AMC 10B Problems/Problem 14"

(Solution)
m (added "Problem" to the top)
Line 1: Line 1:
 +
== Problem ==
 +
 
A list of <math>2018</math> positive integers has a unique mode, which occurs exactly <math>10</math> times. What is the least number of distinct values that can occur in the list?
 
A list of <math>2018</math> positive integers has a unique mode, which occurs exactly <math>10</math> times. What is the least number of distinct values that can occur in the list?
  

Revision as of 01:23, 5 December 2019

Problem

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

$\textbf{(A)}\ 202\qquad\textbf{(B)}\ 223\qquad\textbf{(C)}\ 224\qquad\textbf{(D)}\ 225\qquad\textbf{(E)}\ 234$

Solution

To minimize the number of distinct values, we want to maximize the number of times they appear. So, we could have 223 numbers appear 9 times, 1 number appear once, and the mode appear 10 times, giving us a total of $223 + 1 + 1$ = $\boxed{\textbf{(D) } 225}$

See Also

2018 AMC 10B (ProblemsAnswer KeyResources)
Preceded by
Problem 13
Followed by
Problem 15
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 10 Problems and Solutions
2018 AMC 12B (ProblemsAnswer KeyResources)
Preceded by
Problem 9
Followed by
Problem 11
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png