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

(Added Solution)
(5 intermediate revisions by 5 users not shown)
Line 1: Line 1:
 +
{{duplicate|[[2018 AMC 12B Problems|2018 AMC 12B #10]] and [[2018 AMC 10B Problems|2018 AMC 10B #14]]}}
 +
 +
== 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?
  
Line 5: Line 9:
 
== Solution ==
 
== Solution ==
  
To minimize the number of 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 <math>223 + 1 + 1</math> = <math>\boxed{\textbf{(D) } 225}</math>
+
To minimize the number of distinct values, we want to maximize the number of times they appear. So, we could have <math>223</math> numbers appear <math>9</math> times, <math>1</math> number appear once, and the mode appear <math>10</math> times, giving us a total of <math>223 + 1 + 1</math> = <math>\boxed{\textbf{(D) } 225}</math>
  
 
==See Also==
 
==See Also==
  
 
{{AMC10 box|year=2018|ab=B|num-b=13|num-a=15}}
 
{{AMC10 box|year=2018|ab=B|num-b=13|num-a=15}}
 +
{{AMC12 box|year=2018|ab=B|num-b=9|num-a=11}}
 
{{MAA Notice}}
 
{{MAA Notice}}
 +
 +
[[Category:Introductory Combinatorics Problems]]

Revision as of 20:43, 31 December 2020

The following problem is from both the 2018 AMC 12B #10 and 2018 AMC 10B #14, so both problems redirect to this page.

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