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 "2002 AMC 10P Problems/Problem 15"

(→‎Solution)
Line 1: Line 1:
−
\tableofcontents
 
−
 
 
== Problem ==
 
== Problem ==
 
What is the smallest integer <math>n</math> for which any subset of <math>\{ 1, 2, 3, \; \dots \; , 20 \}</math> of size <math>n</math> must contain two numbers that differ by 8?
 
What is the smallest integer <math>n</math> for which any subset of <math>\{ 1, 2, 3, \; \dots \; , 20 \}</math> of size <math>n</math> must contain two numbers that differ by 8?
Line 7: Line 5:
  
 
== Solution ==
 
== Solution ==
−
There are twelve pairs <math>\{ 1, 9 \}</math>, <math>\{ 2, 10 \}</math>, <math>\{ 3, 11 \}</math>, <math>\{ 4, 11 \}</math>, <math>\; \dots \; \{ 12, 20 \}</math> in <math>\{ 1, 2, 3, \; \dots \; , 20 \}</math> that differ by 8. If we take <math>n = 12</math>, it could be that we selected one element from each pair for the subset: the condition may not be fulfilled. In order to select at least one pair, it is necessary to select <math>\textbf{(D)} \; 13</math> elements (Pigeonhole principle).
+
There are twelve pairs <math>\{ 1, 9 \}</math>, <math>\{ 2, 10 \}</math>, <math>\{ 3, 11 \}</math>, <math>\{ 4, 11 \}</math>, <math>\; \dots \; \{ 12, 20 \}</math> in <math>\{ 1, 2, 3, \; \dots \; , 20 \}</math> that differ by 8. If we take <math>n = 12</math>, it could be that we selected one element from each pair for the subset: the condition may not be fulfilled. By the Pigeonhole principle, in order to select at least one pair, it is necessary to select <math>\boxed{\textbf{(D) } 13}</math> elements.
 +
~green_lotus
  
−
<i>Solution submitted by green_lotus</i>
+
== See Also ==
 +
{{AMC10 box|year=2002|ab=P|num-b=14|num-a=16}}
 +
{{MAA Notice}}

Revision as of 18:58, 14 July 2024

Problem

What is the smallest integer $n$ for which any subset of $\{ 1, 2, 3, \; \dots \; , 20 \}$ of size $n$ must contain two numbers that differ by 8?

$\textbf{(A)} \; 2 \quad \textbf{(B)} \; 8 \quad \textbf{(C)} \; 12 \quad \textbf{(D)} \; 13 \quad \textbf{(E)} \; 15$

Solution

There are twelve pairs $\{ 1, 9 \}$, $\{ 2, 10 \}$, $\{ 3, 11 \}$, $\{ 4, 11 \}$, $\; \dots \; \{ 12, 20 \}$ in $\{ 1, 2, 3, \; \dots \; , 20 \}$ that differ by 8. If we take $n = 12$, it could be that we selected one element from each pair for the subset: the condition may not be fulfilled. By the Pigeonhole principle, in order to select at least one pair, it is necessary to select $\boxed{\textbf{(D) } 13}$ elements. ~green_lotus

See Also

2002 AMC 10P (Problems • Answer Key • Resources)
Preceded by
Problem 14 		Followed by
Problem 16
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=2002_AMC_10P_Problems/Problem_15&oldid=222428"