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 "2024 AMC 10B Problems/Problem 17"

m (→‎Solution 3 (Get Lucky))
 
(2 intermediate revisions by 2 users not shown)
Line 5: Line 5:
  
 
==Solution 1==
 
==Solution 1==
 +
Intuitive solution:
 
We perform casework based on how many snails tie. Let's say we're dealing with the following snails: <math>A,B,C,D,E</math>.
 
We perform casework based on how many snails tie. Let's say we're dealing with the following snails: <math>A,B,C,D,E</math>.
  
Line 15: Line 16:
 
<math>2</math> snails tied: We have <math>AB, C, D, E</math>. There are <math>4! = 24</math> ways to determine the ranking of the <math>4</math> groups. There are <math>5\choose{3}</math> ways to determine the three snails not involved in the tie. So <math>24 \cdot 10 = 240</math> ways.
 
<math>2</math> snails tied: We have <math>AB, C, D, E</math>. There are <math>4! = 24</math> ways to determine the ranking of the <math>4</math> groups. There are <math>5\choose{3}</math> ways to determine the three snails not involved in the tie. So <math>24 \cdot 10 = 240</math> ways.
  
−
It's impossible to have "1 snail tie", so that case has <math>0</math> ways.
+
<math>1</math> snail tied: This is basically just every snail for a place, so <math>5! = 120</math> ways.
  
−
Finally, there are no ties. We just arrange the <math>5</math> snails, so <math>5! = 120</math> ways.
+
The answer is <math>1+10+60+240+120 = \boxed{\text{(D) }431}</math>.
−
 
 
−
The answer is <math>1+10+60+240+0+120 = \boxed{\text{(D) }431}</math>.
 
  
 
~lprado
 
~lprado
  
−
==Solution 2 (Solution 1 but less words)==
+
==Solution 2==
 
Split the problem into cases. A tie of <math>n</math> snails has <math>\dbinom{5}{n}</math> ways to choose the snails that are tied, <math>6-n</math> ways to choose which place they tie for, and <math>(5-n)!</math> to place the remaining snails.
 
Split the problem into cases. A tie of <math>n</math> snails has <math>\dbinom{5}{n}</math> ways to choose the snails that are tied, <math>6-n</math> ways to choose which place they tie for, and <math>(5-n)!</math> to place the remaining snails.
  
Line 42: Line 41:
 
~shreyan.chethan
 
~shreyan.chethan
  
−
Notice that with 2 remaining choices, through guessing, the expected value of your points is <math>\frac{6}{2}=3</math>, and not answering gives 1.5 points. Therefore, you gain an expected value of <math>1.5</math> points by answering. It would be best to always guess whenever you can get rid of <math>2</math> or more answers. If you can only eliminate <math>1</math> answer, not guessing will give you <math>1.5</math> points, but guessing also gives you an expected value of <math>1.5 points. I usually leave it blank if I can only get rid of </math>1$ answer choice.
+
Notice that with 2 remaining choices, through guessing, the expected value of your points is <math>\frac{6}{2}=3</math>, and not answering gives 1.5 points. Therefore, you gain an expected value of <math>1.5</math> points by answering. It would be best to always guess whenever you can get rid of <math>2</math> or more answers. If you can only eliminate <math>1</math> answer, not guessing will give you <math>1.5</math> points, but guessing also gives you an expected value of <math>1.5</math> points. I usually leave it blank if I can only get rid of <math>1</math> answer choice.
 
~shreyan.chethan, edited by BenjaminDong01, last part added by PerseverePlayer
 
~shreyan.chethan, edited by BenjaminDong01, last part added by PerseverePlayer
  

Latest revision as of 19:03, 9 January 2025

Problem

In a race among $5$ snails, there is at most one tie, but that tie can involve any number of snails. For example, the result might be that Dazzler is first; Abby, Cyrus, and Elroy are tied for second; and Bruna is fifth. How many different results of the race are possible?

$\textbf{(A) } 180 \qquad\textbf{(B) } 361 \qquad\textbf{(C) } 420 \qquad\textbf{(D) } 431 \qquad\textbf{(E) } 720$

Solution 1

Intuitive solution: We perform casework based on how many snails tie. Let's say we're dealing with the following snails: $A,B,C,D,E$.

$5$ snails tied: All $5$ snails tied for $1$st place, so only $1$ way.

$4$ snails tied: $A,B,C,D$ all tied, and $E$ either got $1$st or last. ${5}\choose{1}$ ways to choose who isn't involved in the tie and $2$ ways to choose if that snail gets first or last, so $10$ ways.

$3$ snails tied: We have $ABC, D, E$. There are $3! = 6$ ways to determine the ranking of the $3$ groups. There are $5\choose2$ ways to determine the two snails not involved in the tie. So $6 \cdot 10 = 60$ ways.

$2$ snails tied: We have $AB, C, D, E$. There are $4! = 24$ ways to determine the ranking of the $4$ groups. There are $5\choose{3}$ ways to determine the three snails not involved in the tie. So $24 \cdot 10 = 240$ ways.

$1$ snail tied: This is basically just every snail for a place, so $5! = 120$ ways.

The answer is $1+10+60+240+120 = \boxed{\text{(D) }431}$.

~lprado

Solution 2

Split the problem into cases. A tie of $n$ snails has $\dbinom{5}{n}$ ways to choose the snails that are tied, $6-n$ ways to choose which place they tie for, and $(5-n)!$ to place the remaining snails.

1. No tie $\implies5!=120$

2. Tie of 2 snails $\implies\dbinom{5}{2}\cdot4\cdot3!=240$

3. Tie of 3 snails $\implies\dbinom{5}{3}\cdot3\cdot2!=60$

4. Tie of 4 snails $\implies\dbinom{5}{4}\cdot2=10$

5. Tie of all 5 snails $\implies1$

The answer is $120+240+60+10+1=\boxed{\text{(D) }431}$ ~Tacos_are_yummy_1

Solution 3 (Get Lucky)

For the case of a 5-way tie, we have $\dbinom{5}{5}=1$ cases. We can assume this leads to an answer that ends in 1, leaving only $B$ and $D$. By just accounting for the cases for a 1-way tie ($5!=120$) and 2-way tie ($\dbinom{5}{2}\cdot4\cdot3!=240$), it immediately shows that $B$ does not work. Therefore, the answer is $\boxed{\text{(D) }431}$ ~shreyan.chethan

Notice that with 2 remaining choices, through guessing, the expected value of your points is $\frac{6}{2}=3$, and not answering gives 1.5 points. Therefore, you gain an expected value of $1.5$ points by answering. It would be best to always guess whenever you can get rid of $2$ or more answers. If you can only eliminate $1$ answer, not guessing will give you $1.5$ points, but guessing also gives you an expected value of $1.5$ points. I usually leave it blank if I can only get rid of $1$ answer choice. ~shreyan.chethan, edited by BenjaminDong01, last part added by PerseverePlayer

Video Solution 1 by Pi Academy (Fast and Easy ⚡🚀)

https://youtu.be/c6nhclB5V1w?feature=shared

~ Pi Academy

Video Solution 2 by SpreadTheMathLove

https://www.youtube.com/watch?v=Q7fwWZ89MC8

See also

2024 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

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=2024_AMC_10B_Problems/Problem_17&oldid=239449"