Difference between revisions of "2024 AMC 10B Problems/Problem 17"

m (Protected "2024 AMC 10B Problems/Problem 17" ([Edit=Allow only administrators] (expires 04:59, 14 November 2024 (UTC)) [Move=Allow only administrators] (expires 04:59, 14 November 2024 (UTC))))
Line 1: Line 1:
 +
==Solution 1==
 +
We perform casework based on how many people tie. Let's say we're dealing with the following people: <math>A,B,C,D,E</math>.
  
 +
<math>5</math> people tied: All <math>5</math> people tied for <math>1</math>st place, so only <math>1</math> way.
 +
 +
<math>4</math> people tied: <math>A,B,C,D</math> all tied, and <math>E</math> either got <math>1</math>st or last. <math>{5}\choose{1}</math> ways to choose who isn't involved in the tie and <math>2</math> ways to choose if that person gets first or last, so <math>10</math> ways.
 +
 +
<math>3</math> people tied: We have <math>ABC, D, E</math>. There are <math>3! = 6</math> ways to determine the ranking of the <math>3</math> groups. There are <math>5\choose2</math> ways to determine the two people not involved in the tie. So <math>6 \cdot 10 = 60</math> ways.
 +
 +
<math>2</math> people 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 people not involved in the tie. So <math>24 \cdot 10 = 240</math> ways.
 +
 +
It's impossible to have "1 person tie", so that case has <math>0</math> ways.
 +
 +
Finally, there are no ties. We just arrange the <math>5</math> people, so <math>5! = 120</math> ways.
 +
 +
The answer is <math>1+10+60+240+0+120 = \boxed{431}</math>.
 +
 +
~lprado

Revision as of 00:15, 14 November 2024

Solution 1

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

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

$4$ people 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 person gets first or last, so $10$ ways.

$3$ people 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 people not involved in the tie. So $6 \cdot 10 = 60$ ways.

$2$ people 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 people not involved in the tie. So $24 \cdot 10 = 240$ ways.

It's impossible to have "1 person tie", so that case has $0$ ways.

Finally, there are no ties. We just arrange the $5$ people, so $5! = 120$ ways.

The answer is $1+10+60+240+0+120 = \boxed{431}$.

~lprado