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 "2017 AMC 12B Problems/Problem 25"

(→‎Solution)
m (→‎Solution)
 
(14 intermediate revisions by 9 users not shown)
Line 7: Line 7:
 
==Solution==
 
==Solution==
  
−
Solution by Pieater314159
+
Let there be <math>T</math> teams. For each team, there are <math>{n-5\choose 4}</math> different subsets of <math>9</math> players that includes a given full team, so the total number of team-(group of 9) pairs is  
−
 
 
−
Let there be <math>T</math> teams. For each team, there are <math>{n-5\choose 4}</math> different subsets of <math>9</math> players including that full team, so the total number of team-(group of 9) pairs is  
 
  
 
<cmath>T{n-5\choose 4}.</cmath>
 
<cmath>T{n-5\choose 4}.</cmath>
Line 39: Line 37:
 
<cmath>2^5\cdot3^2\cdot5\cdot7\big|(n)(n-1)(n-2)(n-3)(n-4).</cmath>
 
<cmath>2^5\cdot3^2\cdot5\cdot7\big|(n)(n-1)(n-2)(n-3)(n-4).</cmath>
  
−
It is obvious that <math>5</math> divides the RHS, and that <math>7</math> does iff <math>n\equiv 0,1,2,3,4\mod 7</math>. Also, <math>3^2</math> divides it iff <math>n\not\equiv 5,8\mod 9</math>. One can also bash out that <math>2^5</math> divides it in <math>16</math> out of the <math>32</math> possible residues <math>\mod 32</math>.  
+
It is obvious that <math>5</math> divides the RHS, and that <math>7</math> does if <math>n\equiv 0,1,2,3,4\mod 7</math>. Also, <math>3^2</math> divides it if <math>n\not\equiv 5,8\mod 9</math>. One can also bash out that <math>2^5</math> divides it in <math>16</math> out of the <math>32</math> possible residues <math>\mod 32</math>.
 +
 
 +
Note that <math>2016 = 7*9*32</math> so by using all numbers from <math>2</math> to <math>2017</math>, inclusive, it is clear that each possible residue <math>\mod 7,9,32</math> is reached an equal number of times, so the total number of working <math>n</math> in that range is <math>5\cdot 7\cdot 16 = 560</math>. However, we must subtract the number of "working" <math>2\leq n\leq 8</math>, which is <math>3</math>. Thus, the answer is <math>\boxed{\textbf{(D) } 557}</math>.
 +
 
 +
Alternatively, it is enough to approximate by finding the floor of <math>2017 \cdot \frac57 \cdot \frac79 \cdot \frac12 - 3</math> to get <math>\boxed{\textbf{(D) } 557}</math>.
  
−
Using all numbers from <math>2</math> to <math>2017</math>, inclusive, it is clear that each possible residue <math>\mod 7,9,32</math> is reached an equal number of times, so the total number of working <math>n</math> in that range is <math>5\cdot 7\cdot 16 = 560</math>. However, we must subtract the number of "working" <math>2\leq n\leq 8</math>, which is <math>3</math>. Thus, the answer is <math>\textbf{(D) } 557</math>.
+
==Solution 1.0==
 +
Another way to find the average number of teams in a group of 9 or 8 people is as follows:
 +
 
 +
Let there be <math>T</math> teams. There are <math>\binom{n}{5}</math> total possible teams. So, the probability of any 5 people being a team is <math>\frac{T}{\binom{n}{5}}</math>. There are <math>\binom{9}{5}</math> possible teams in a group of 9. So, on average, there will be
 +
<cmath>\frac{T}{\binom{n}{5}} \binom{9}{5} </cmath>
 +
teams in any group of 9 people. Similarly, on average, there will be
 +
<cmath>\frac{T}{\binom{n}{5}} \binom{8}{5} </cmath>
 +
teams in any group of 8 people. So,
 +
\begin{align*}
 +
\frac{T}{\binom{n}{5}} \binom{9}{5} = \frac{1}{\frac{T}{\binom{n}{5}} \binom{8}{5}} \implies& \binom{9}{5}\binom{8}{5} T^2 = \binom{n}{5}^2 \\
 +
\implies& 84T = \binom{n}{5}
 +
\end{align*}
 +
Therefore <math>84 \mid \binom{n}{5}</math> and proceed as shown in solution 1.
 +
 
 +
FYI, to find n such that <math>32 \mid n(n-1)(n-2)(n-3)(n-4)</math> without bashing everything:
 +
Clearly <math>n \equiv 0, 1, 2, 3, 4 \pmod{32}</math> works. Then, do cases.
 +
 
 +
Case 1: <math>4 \mid n</math>.
 +
This will always work, as <math>4 \mid n</math>, <math>4 \mid n-4</math>, and <math>2 \mid n-2</math>, so <math>4 \cdot 4 \cdot 2 = 32 \mid n(n-1)(n-2)(n-3)(n-4)</math>. So,
 +
<cmath>n \equiv 0, 4, 8, 12, 16, 20, 24, 28 \pmod{32}</cmath>
 +
are also solutions.
 +
 
 +
Case 2: <math>n \equiv 2 \pmod{4}</math>
 +
Then <math>n-4 \equiv 2 \pmod{4}</math> as well. <math>n</math> and <math>n-4</math> can only contribute one 2 each, since <math>4 \nmid n, n-4</math>. We need a factor of <math>2^3</math> in <math>n-2</math> then. So, <math>n \equiv 2 \pmod{8}</math>. Then, we get
 +
<cmath>n \equiv 2, 10, 18, 26 \pmod{32}</cmath>.
 +
 
 +
Case 3: <math>4 \nmid n</math>
 +
We can only get twos from <math>n-1</math> and <math>n-3</math>. Note that one of them can only contribute a single factor of 2, because otherwise <math>4 \mid n-1</math> and <math>4 \mid n-3</math>, so <math>n</math> has a remainder of both 1 and 3 mod 4, which is impossible. So, one must have a factor of 16. We get <math>n \equiv 1, 3 \pmod{16}</math> so
 +
<cmath>n \equiv 1, 3, 17, 19 \pmod{32}</cmath>
 +
 
 +
In all, we get the solutions
 +
<cmath> n \equiv 0, 1, 2, 3, 4, 8, 10, 16, 17, 18, 19, 20, 24, 26, 28 \pmod{32} </cmath>
 +
 
 +
~[https://artofproblemsolving.com/wiki/index.php/User:Crazyvideogamez CrazyVideoGamez]
 +
 
 +
==Video Solution by Dr. Nal==
 +
 
 +
https://www.youtube.com/watch?v=2p2qYRWbvV4&feature=emb_logo
  
 
==See Also==
 
==See Also==
 
{{AMC12 box|year=2017|ab=B|num-b=24|after=Last Problem}}
 
{{AMC12 box|year=2017|ab=B|num-b=24|after=Last Problem}}
 
{{MAA Notice}}
 
{{MAA Notice}}
 +
 +
[[Category:Intermediate Combinatorics Problems]]

Latest revision as of 17:23, 16 October 2024

Problem

A set of $n$ people participate in an online video basketball tournament. Each person may be a member of any number of $5$-player teams, but no two teams may have exactly the same $5$ members. The site statistics show a curious fact: The average, over all subsets of size $9$ of the set of $n$ participants, of the number of complete teams whose members are among those $9$ people is equal to the reciprocal of the average, over all subsets of size $8$ of the set of $n$ participants, of the number of complete teams whose members are among those $8$ people. How many values $n$, $9\leq n\leq 2017$, can be the number of participants?

$\textbf{(A) } 477 \qquad \textbf{(B) } 482 \qquad \textbf{(C) } 487 \qquad \textbf{(D) } 557 \qquad \textbf{(E) } 562$

Solution

Let there be $T$ teams. For each team, there are ${n-5\choose 4}$ different subsets of $9$ players that includes a given full team, so the total number of team-(group of 9) pairs is

\[T{n-5\choose 4}.\]

Thus, the expected value of the number of full teams in a random set of $9$ players is

\[\frac{T{n-5\choose 4}}{{n\choose 9}}.\]

Similarly, the expected value of the number of full teams in a random set of $8$ players is

\[\frac{T{n-5\choose 3}}{{n\choose 8}}.\]

The condition is thus equivalent to the existence of a positive integer $T$ such that

\[\frac{T{n-5\choose 4}}{{n\choose 9}}\frac{T{n-5\choose 3}}{{n\choose 8}} = 1.\]

\[T^2\frac{(n-5)!(n-5)!8!9!(n-8)!(n-9)!}{n!n!(n-8)!(n-9)!3!4!} = 1\]

\[T^2 = \big((n)(n-1)(n-2)(n-3)(n-4)\big)^2 \frac{3!4!}{8!9!}\]

\[T^2 = \big((n)(n-1)(n-2)(n-3)(n-4)\big)^2 \frac{144}{7!7!8\cdot8\cdot9}\]

\[T^2 = \big((n)(n-1)(n-2)(n-3)(n-4)\big)^2 \frac{1}{4\cdot7!7!}\]

\[T = \frac{(n)(n-1)(n-2)(n-3)(n-4)}{2^5\cdot3^2\cdot5\cdot7}\]

Note that this is always less than ${n\choose 5}$, so as long as $T$ is integral, $n$ is a possibility. Thus, we have that this is equivalent to

\[2^5\cdot3^2\cdot5\cdot7\big|(n)(n-1)(n-2)(n-3)(n-4).\]

It is obvious that $5$ divides the RHS, and that $7$ does if $n\equiv 0,1,2,3,4\mod 7$. Also, $3^2$ divides it if $n\not\equiv 5,8\mod 9$. One can also bash out that $2^5$ divides it in $16$ out of the $32$ possible residues $\mod 32$.

Note that $2016 = 7*9*32$ so by using all numbers from $2$ to $2017$, inclusive, it is clear that each possible residue $\mod 7,9,32$ is reached an equal number of times, so the total number of working $n$ in that range is $5\cdot 7\cdot 16 = 560$. However, we must subtract the number of "working" $2\leq n\leq 8$, which is $3$. Thus, the answer is $\boxed{\textbf{(D) } 557}$.

Alternatively, it is enough to approximate by finding the floor of $2017 \cdot \frac57 \cdot \frac79 \cdot \frac12 - 3$ to get $\boxed{\textbf{(D) } 557}$.

Solution 1.0

Another way to find the average number of teams in a group of 9 or 8 people is as follows:

Let there be $T$ teams. There are $\binom{n}{5}$ total possible teams. So, the probability of any 5 people being a team is $\frac{T}{\binom{n}{5}}$. There are $\binom{9}{5}$ possible teams in a group of 9. So, on average, there will be \[\frac{T}{\binom{n}{5}} \binom{9}{5}\] teams in any group of 9 people. Similarly, on average, there will be \[\frac{T}{\binom{n}{5}} \binom{8}{5}\] teams in any group of 8 people. So, \begin{align*} \frac{T}{\binom{n}{5}} \binom{9}{5} = \frac{1}{\frac{T}{\binom{n}{5}} \binom{8}{5}} \implies& \binom{9}{5}\binom{8}{5} T^2 = \binom{n}{5}^2 \\ \implies& 84T = \binom{n}{5} \end{align*} Therefore $84 \mid \binom{n}{5}$ and proceed as shown in solution 1.

FYI, to find n such that $32 \mid n(n-1)(n-2)(n-3)(n-4)$ without bashing everything: Clearly $n \equiv 0, 1, 2, 3, 4 \pmod{32}$ works. Then, do cases.

Case 1: $4 \mid n$. This will always work, as $4 \mid n$, $4 \mid n-4$, and $2 \mid n-2$, so $4 \cdot 4 \cdot 2 = 32 \mid n(n-1)(n-2)(n-3)(n-4)$. So, \[n \equiv 0, 4, 8, 12, 16, 20, 24, 28 \pmod{32}\] are also solutions.

Case 2: $n \equiv 2 \pmod{4}$ Then $n-4 \equiv 2 \pmod{4}$ as well. $n$ and $n-4$ can only contribute one 2 each, since $4 \nmid n, n-4$. We need a factor of $2^3$ in $n-2$ then. So, $n \equiv 2 \pmod{8}$. Then, we get \[n \equiv 2, 10, 18, 26 \pmod{32}\].

Case 3: $4 \nmid n$ We can only get twos from $n-1$ and $n-3$. Note that one of them can only contribute a single factor of 2, because otherwise $4 \mid n-1$ and $4 \mid n-3$, so $n$ has a remainder of both 1 and 3 mod 4, which is impossible. So, one must have a factor of 16. We get $n \equiv 1, 3 \pmod{16}$ so \[n \equiv 1, 3, 17, 19 \pmod{32}\]

In all, we get the solutions \[n \equiv 0, 1, 2, 3, 4, 8, 10, 16, 17, 18, 19, 20, 24, 26, 28 \pmod{32}\]

~CrazyVideoGamez

Video Solution by Dr. Nal

https://www.youtube.com/watch?v=2p2qYRWbvV4&feature=emb_logo

See Also

2017 AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 24 		Followed by
Last Problem
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=2017_AMC_12B_Problems/Problem_25&oldid=230021"