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 "2015 AMC 10A Problems/Problem 22"
(→‎Solution)
Line 7: Line 7:
  
 
==Solution==
 
==Solution==
 +
===Solution 1===
 
We will count how many valid standing arrangements are there (counting rotations as distinct), and divide by <math>2^8 = 256</math> at the end. We casework on how many people is standing.
 
We will count how many valid standing arrangements are there (counting rotations as distinct), and divide by <math>2^8 = 256</math> at the end. We casework on how many people is standing.
  
Line 22: Line 23:
  
 
Summing gives 1 + 8 + 20 + 2 + 16 = 47, and so our probability is <math>\boxed{\textbf{(A) } \dfrac{47}{256}}</math>.
 
Summing gives 1 + 8 + 20 + 2 + 16 = 47, and so our probability is <math>\boxed{\textbf{(A) } \dfrac{47}{256}}</math>.
 +
 +
===Solution 2===
 +
We will count how many valid standing arrangements there are counting rotations as distinct and divide by 256 at the end.
 +
Line up all 8 people linearly.  In order for no two people standing to be adjacent, we will place a sitting person to the right of each standing person.  In effect, each standing person requires 2 spaces and the standing people are separated by sitting people and the problem becomes Pirates and Gold.
 +
 +
If there are 4 standing, there are <math>{4 \choose 4}=1</math> ways to place them.
 +
For 3, there are <math>{3+2 \choose 3}=10</math> ways.
 +
etc.
 +
Summing, we get <math>{4 \choose 4}+{5 \choose 3}+{6 \choose 2}+{7 \choose 1}+{8 \choose 0}=1+10+15+7+1=34</math> ways.
 +
 +
Now we consider that the far right person can be standing as well, so we have
 +
<math>{3 \choose 3}+{4 \choose 2}+{5 \choose 1}+{6 \choose 0}=1+6+5+1=13</math> ways
 +
 +
Together we have <math>34+13=47</math>, and so our probability is <math>\boxed{\textbf{(A) } \dfrac{47}{256}}</math>.
  
 
== See Also ==
 
== See Also ==

Revision as of 02:39, 9 February 2015

The following problem is from both the 2015 AMC 12A #17 and 2015 AMC 10A #22, so both problems redirect to this page.

Problem

Eight people are sitting around a circular table, each holding a fair coin. All eight people flip their coins and those who flip heads stand while those who flip tails remain seated. What is the probability that no two adjacent people will stand?

$\textbf{(A)}\dfrac{47}{256}\qquad\textbf{(B)}\dfrac{3}{16}\qquad\textbf{(C) }\dfrac{49}{256}\qquad\textbf{(D) }\dfrac{25}{128}\qquad\textbf{(E) }\dfrac{51}{256}$

Solution

Solution 1

We will count how many valid standing arrangements are there (counting rotations as distinct), and divide by $2^8 = 256$ at the end. We casework on how many people is standing.

Case 1: 0 people are standing. This yields 1 arrangement.

Case 2: 1 person is standing. This yields 8 arrangements.

Case 3: 2 people are standing. This yields $\dbinom{8}{2} - 8 = 20$ arrangements, because the two people cannot be next to each other.

Case 4: 4 people are standing. Then the people must be arranged in stand-sit-stand-sit-stand-sit-stand-sit fashion, yielding 2 possible arrangements.

More difficult is:

Case 5: 3 people are standing. First, choose the location of the first person standing (8 choices). Next, choose 2 of the remaining people in the remaining 5 legal seats to stand, amounting to 6 arrangements considering that these two people cannot stand next to each other. However, we have to divide by 3, because there are 3 ways to choose the first person given any three. This yields 8 * 6 / 3 = 16 arrangements for Case 5.

Summing gives 1 + 8 + 20 + 2 + 16 = 47, and so our probability is $\boxed{\textbf{(A) } \dfrac{47}{256}}$.

Solution 2

We will count how many valid standing arrangements there are counting rotations as distinct and divide by 256 at the end. Line up all 8 people linearly. In order for no two people standing to be adjacent, we will place a sitting person to the right of each standing person. In effect, each standing person requires 2 spaces and the standing people are separated by sitting people and the problem becomes Pirates and Gold.

If there are 4 standing, there are ${4 \choose 4}=1$ ways to place them. For 3, there are ${3+2 \choose 3}=10$ ways. etc. Summing, we get ${4 \choose 4}+{5 \choose 3}+{6 \choose 2}+{7 \choose 1}+{8 \choose 0}=1+10+15+7+1=34$ ways.

Now we consider that the far right person can be standing as well, so we have ${3 \choose 3}+{4 \choose 2}+{5 \choose 1}+{6 \choose 0}=1+6+5+1=13$ ways

Together we have $34+13=47$, and so our probability is $\boxed{\textbf{(A) } \dfrac{47}{256}}$.

See Also

2015 AMC 10A (Problems • Answer Key • Resources)
Preceded by
Problem 21 		Followed by
Problem 23
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
2015 AMC 12A (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 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=2015_AMC_10A_Problems/Problem_22&oldid=67735"