Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2011 AMC 10B Problems/Problem 11"
(→‎Solution)
 
(2 intermediate revisions by 2 users not shown)
Line 1: Line 1:
−
== Problem 11 ==
+
== Problem==
  
 
There are <math>52</math> people in a room. what is the largest value of <math>n</math> such that the statement "At least <math>n</math> people in this room have birthdays falling in the same month" is always true?
 
There are <math>52</math> people in a room. what is the largest value of <math>n</math> such that the statement "At least <math>n</math> people in this room have birthdays falling in the same month" is always true?
Line 7: Line 7:
 
==Solution==
 
==Solution==
  
−
Pretend you have <math>52</math> people you want to place  in <math>12</math> boxes. By the [[Pigeonhole Principle]], one box must have at least <math>\left\lceil \frac{52}{12} \right\rceil</math> people <math>\longrightarrow \boxed{\textbf{(D)} 5}</math>
+
Pretend you have <math>52</math> people you want to place  in <math>12</math> boxes, because there are <math>12</math> months in a year. By the [[Pigeonhole Principle]], one box must have at least <math>\left\lceil \frac{52}{12} \right\rceil</math> people <math>\longrightarrow \boxed{\textbf{(D)} 5}</math>
 +
 
 +
== See Also==
 +
 
 +
{{AMC10 box|year=2011|ab=B|num-b=10|num-a=12}}
 +
{{MAA Notice}}

Latest revision as of 22:20, 16 February 2016

Problem

There are $52$ people in a room. what is the largest value of $n$ such that the statement "At least $n$ people in this room have birthdays falling in the same month" is always true?

$\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 12$

Solution

Pretend you have $52$ people you want to place in $12$ boxes, because there are $12$ months in a year. By the Pigeonhole Principle, one box must have at least $\left\lceil \frac{52}{12} \right\rceil$ people $\longrightarrow \boxed{\textbf{(D)} 5}$

See Also

2011 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 10 		Followed by
Problem 12
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

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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2011_AMC_10B_Problems/Problem_11&oldid=76365"