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 "2020 AMC 10B Problems/Problem 17"
(→‎Solution 2)
 
(37 intermediate revisions by 20 users not shown)
Line 1: Line 1:
 +
{{duplicate|[[2020 AMC 10B Problems|2020 AMC 10B #17]] and [[2020 AMC 12B Problems|2020 AMC 12B #15]]}}
 +
 
==Problem==
 
==Problem==
  
Line 5: Line 7:
 
<math>\textbf{(A)}\ 11 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\  13 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 15</math>
 
<math>\textbf{(A)}\ 11 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\  13 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 15</math>
  
−
==Solution==
+
==Solution 1==
−
Let us use casework on the number of diagonals.
+
Consider the <math>10</math> people to be standing in a circle, where two people opposite each other form a diameter of the circle.
 +
 
 +
Let us use casework on the number of pairs that form a diameter of the circle.
 +
 
 +
Case 1: <math>0</math> diameters
  
−
Case 1: <math>0</math> diagonals
 
 
There are <math>2</math> ways: either <math>1</math> pairs with <math>2</math>, <math>3</math> pairs with <math>4</math>, and so on or <math>10</math> pairs with <math>1</math>, <math>2</math> pairs with <math>3</math>, etc.
 
There are <math>2</math> ways: either <math>1</math> pairs with <math>2</math>, <math>3</math> pairs with <math>4</math>, and so on or <math>10</math> pairs with <math>1</math>, <math>2</math> pairs with <math>3</math>, etc.
  
−
Case 2: <math>1</math> diagonal
+
Case 2: <math>1</math> diameter
−
There are <math>5</math> possible diagonals to draw (everyone else pairs with the person next to them.
+
 
 +
There are <math>5</math> possible diameters to draw (everyone else pairs with the person next to them).
 +
 
 +
Note that there cannot be <math>2</math> diameters since there would be one person on either side that will not have a pair adjacent to them. The only scenario forced is when the two people on either side would be paired up across a diameter. Thus, a contradiction will arise.
 +
 
 +
Case 3: <math>3</math> diameters
 +
 
 +
There are <math>5</math> possible sets of <math>3</math> diameters to draw.
 +
Notice we are technically choosing the number of ways to choose a pair of two diameters that are neighbors to each other. This means we can choose the first diameter in the pair, and have only two diameters to choose from for the second in the pair. This means we have <math>5*2=10</math> possibilities for choosing 5 neighboring diameters. However, notice that there are duplicates, so we divide the <math>10</math> possibilities by <math>2</math> to get <math>5</math>.
 +
 
 +
Note that there cannot be a case with <math>4</math> diameters because then there would have to be <math>5</math> diameters for the two remaining people as they have to be connected with a diameter. A contradiction arises.
 +
 
 +
Case 4: <math>5</math> diameters
  
−
Note that there cannot be 2 diagonals.
+
There is only <math>1</math> way to do this.
  
−
Case 3: <math>3</math> diagonals
+
Thus, in total there are <math>2+5+5+1=\boxed{\textbf{(C) }13}</math> possible ways.
 +
~Pearl2008 (Minor Edits)
  
−
Note that there cannot be a case with 4 diagonals because then there would have to be 5 diagonals for the two remaining people, thus a contradiction.
+
==Video Solution (HOW TO THINK CRITICALLY!!!)==
 +
https://youtu.be/t1WQTZ8TF7k
  
−
Case 4: <math>5</math> diagonals
+
~Education, the Study of Everything
−
There is <math>1</math> way to do this.
 
  
−
Thus, in total there are <math>2+5+5+1=\boxed{13}</math> possible ways.
+
==Video Solution by TheBeautyOfMath==
 +
https://youtu.be/3BvJeZU3T-M?t=419
  
−
==Video Solution==
+
https://youtu.be/0xgTR3UEqbQ
−
https://youtu.be/3BvJeZU3T-M
 
  
−
~IceMatrix
+
== Video Solution by Sohil Rathi ==
 +
https://youtu.be/0W3VmFp55cM?t=2796
  
 
==See Also==
 
==See Also==

Latest revision as of 15:41, 14 October 2024

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

Problem

There are $10$ people standing equally spaced around a circle. Each person knows exactly $3$ of the other $9$ people: the $2$ people standing next to her or him, as well as the person directly across the circle. How many ways are there for the $10$ people to split up into $5$ pairs so that the members of each pair know each other?

$\textbf{(A)}\ 11 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ 13 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 15$

Solution 1

Consider the $10$ people to be standing in a circle, where two people opposite each other form a diameter of the circle.

Let us use casework on the number of pairs that form a diameter of the circle.

Case 1: $0$ diameters

There are $2$ ways: either $1$ pairs with $2$, $3$ pairs with $4$, and so on or $10$ pairs with $1$, $2$ pairs with $3$, etc.

Case 2: $1$ diameter

There are $5$ possible diameters to draw (everyone else pairs with the person next to them).

Note that there cannot be $2$ diameters since there would be one person on either side that will not have a pair adjacent to them. The only scenario forced is when the two people on either side would be paired up across a diameter. Thus, a contradiction will arise.

Case 3: $3$ diameters

There are $5$ possible sets of $3$ diameters to draw. Notice we are technically choosing the number of ways to choose a pair of two diameters that are neighbors to each other. This means we can choose the first diameter in the pair, and have only two diameters to choose from for the second in the pair. This means we have $5*2=10$ possibilities for choosing 5 neighboring diameters. However, notice that there are duplicates, so we divide the $10$ possibilities by $2$ to get $5$.

Note that there cannot be a case with $4$ diameters because then there would have to be $5$ diameters for the two remaining people as they have to be connected with a diameter. A contradiction arises.

Case 4: $5$ diameters

There is only $1$ way to do this.

Thus, in total there are $2+5+5+1=\boxed{\textbf{(C) }13}$ possible ways. ~Pearl2008 (Minor Edits)

Video Solution (HOW TO THINK CRITICALLY!!!)

https://youtu.be/t1WQTZ8TF7k

~Education, the Study of Everything

Video Solution by TheBeautyOfMath

https://youtu.be/3BvJeZU3T-M?t=419

https://youtu.be/0xgTR3UEqbQ

Video Solution by Sohil Rathi

https://youtu.be/0W3VmFp55cM?t=2796

See Also

2020 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 16 		Followed by
Problem 18
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
2020 AMC 12B (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 12 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=2020_AMC_10B_Problems/Problem_17&oldid=229839"