Difference between revisions of "2022 AIME II Problems/Problem 10"
Goatpotato (talk | contribs) (→Solution 6 (Combinatorial Method)) |
(→Solution 2 (similar to solution 1)) |
||
Line 53: | Line 53: | ||
Doing simple algebra calculation will give the following equation: | Doing simple algebra calculation will give the following equation: | ||
<cmath>\begin{align*} | <cmath>\begin{align*} | ||
− | \binom{\binom{n}{2}}{2} = \frac{\frac{n(n-1)}{2} \cdot (\frac{n(n-1)}{2}-1)}{2} | + | \binom{\binom{n}{2}}{2} &= \frac{\frac{n(n-1)}{2} \cdot (\frac{n(n-1)}{2}-1)}{2}\ |
− | \ = \frac{n(n-1)(n^2-n-2)}{8} | + | &= \frac{n(n-1)(n^2-n-2)}{8}\ |
− | \ = \frac{(n+1)n(n-1)(n-2)}{8} | + | &= \frac{(n+1)n(n-1)(n-2)}{8}\ |
− | \ = \frac{(n+1)!}{8\cdot (n-3)!} = 3 \cdot \frac{(n+1)!}{4!\cdot (n-3)!} | + | &= \frac{(n+1)!}{8\cdot (n-3)!} = 3 \cdot \frac{(n+1)!}{4!\cdot (n-3)!}\ |
− | \ = 3 \binom{n+1}{4} \end{align*} | + | &= 3 \binom{n+1}{4} \end{align*} |
</cmath> | </cmath> | ||
Next, by using [[Hockey-Stick Identity]], we have: | Next, by using [[Hockey-Stick Identity]], we have: | ||
<cmath>3 \cdot \sum_{i=3}^{40} \binom{n+1}{4} = 3 \binom{42}{5} = 42 \cdot 41 \cdot 39 \cdot 38</cmath> | <cmath>3 \cdot \sum_{i=3}^{40} \binom{n+1}{4} = 3 \binom{42}{5} = 42 \cdot 41 \cdot 39 \cdot 38</cmath> | ||
− | <cmath>=(40^2-2^2)(40^2-1^2) \equiv \boxed{004} (mod 1000)</cmath> | + | <cmath>=(40^2-2^2)(40^2-1^2) \equiv \boxed{004} ~(\text{mod}~ 1000)</cmath> |
− | |||
− | |||
==Solution 3== | ==Solution 3== |
Revision as of 09:57, 9 February 2023
Contents
[hide]Problem
Find the remainder whenis divided by .
Video Solution by OmegaLearn
https://youtu.be/pGkLAX381_s?t=1035
~ pi_is_3.14
Video solution
https://www.youtube.com/watch?v=4O1xiUYjnwE
Solution 1
To solve this problem, we need to use the following result:
Now, we use this result to solve this problem.
We have
Therefore, modulo 1000, .
~Steven Chen (www.professorchenedu.com)
Solution 2 (similar to solution 1)
Doing simple algebra calculation will give the following equation:
Next, by using Hockey-Stick Identity, we have:
Solution 3
Since seems like a completely arbitrary number, we can use Engineer's Induction by listing out the first few sums. These are, in the order of how many terms there are starting from term: , , , , , and . Notice that these are just , , , , , . It's clear that this pattern continues up to terms, noticing that the "indexing" starts with instead of . Thus, the value of the sum is .
~A1001
Solution 4
As in solution 1, obtain Write this as
We can safely write this expression as , since plugging and into both equal meaning they won't contribute to the sum.
Use the sum of powers formulae. We obtain
We can factor the following expression as and simplifying, we have
Substituting and simplifying gets so we would like to find To do this, get Next,
-sirswagger21
Solution 5 (Telescoping)
For the last step, see Solution 1.
~qyang
Solution 6 (Combinatorial Method)
We examine the expression . Imagine we have a set of integers. Then the expression can be translated to the number of pairs of element subsets of .
To count this, note that each pair of element subsets can either share value of values. In the former case, pick three integers , , and . There are ways to select these integers and ways to pick which one of the three is the shared integer. This gives .
In the latter case, we pick integers , , , and in a total of ways. There are ways to split this up into sets of integers — ways to pick which integers are together and dividing by to prevent overcounting. This gives .
So we have We use the Hockey Stick Identity to evaluate this sum: Evaluating while accounting for mod gives the final answer to be .
~ GoatPotato
See Also
2022 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.