Difference between revisions of "2022 AIME II Problems/Problem 13"
m |
(→Solution 5 (Similar to solution 1)) |
||
(14 intermediate revisions by 6 users not shown) | |||
Line 84: | Line 84: | ||
== Solution 2== | == Solution 2== | ||
− | Note that <math>2022 = 210\cdot 9 +132</math>. Since the only way to express <math>132</math> in terms of <math>105</math>, <math>70</math>, <math>42</math>, or <math>30</math> is <math> | + | Note that <math>2022 = 210\cdot 9 +132</math>. Since the only way to express <math>132</math> in terms of <math>105</math>, <math>70</math>, <math>42</math>, or <math>30</math> is <math>132 = 30+30+30+42</math>, we are essentially just counting the number of ways to express <math>210*9</math> in terms of these numbers. Since <math>210 = 2*105=3*70=5*42=7*30</math>, it can only be expressed as a sum in terms of only one of the numbers (<math>105</math>, <math>70</math>, <math>42</math>, or <math>30</math>). Thus, the answer is (by sticks and stones) <cmath>\binom{12}{3} = \boxed{\textbf{(220)}}</cmath> |
~Bigbrain123 | ~Bigbrain123 | ||
− | ==Solution | + | ==Solution 3== |
We know that <math>\frac{a^n-b^n}{a-b}=\sum_{i=0}^{n-1} a^{n-1-i}b^i</math>. Applying this, we see that <cmath>P(x)=(1+x^{105}+x^{210}+...)(1+x^{70}+x^{140}+...)(1+x^{42}+x^{84}+...)(1+x^{30}+x^{60}+...)(x^{4620}-2x^{2310}+1)</cmath> The last factor does not contribute to the <math>x^{2022}</math> term, so we can ignore it. Thus we only have left to solve the equation <math>105b+70c+42d+30e=2022</math>, and we can proceed from here with Solution 1. | We know that <math>\frac{a^n-b^n}{a-b}=\sum_{i=0}^{n-1} a^{n-1-i}b^i</math>. Applying this, we see that <cmath>P(x)=(1+x^{105}+x^{210}+...)(1+x^{70}+x^{140}+...)(1+x^{42}+x^{84}+...)(1+x^{30}+x^{60}+...)(x^{4620}-2x^{2310}+1)</cmath> The last factor does not contribute to the <math>x^{2022}</math> term, so we can ignore it. Thus we only have left to solve the equation <math>105b+70c+42d+30e=2022</math>, and we can proceed from here with Solution 1. | ||
~MathIsFun286 | ~MathIsFun286 | ||
+ | |||
+ | ==Solution 4 (Generating Function Bash)== | ||
+ | |||
+ | Essentially we want the coefficient of <math>x^{2022}</math> in the expansion | ||
+ | |||
+ | <cmath>\frac{1}{(1 - x^{105})(1 - x^{70})(1 - x^{42})(1 - x^{30})}</cmath> | ||
+ | |||
+ | As <math>(x^{2310} -1)^{6}</math> does not contribute to the expansion, we omit it. | ||
+ | |||
+ | Notice <math>\text{lcm}(105,70,42,30) = 210</math>, so we can rewrite the generating function as | ||
+ | |||
+ | |||
+ | <cmath>\frac{(1 + x^{105})(1 + x^{70} + x^{140})(1 + x^{42} + ... + x^{168})(1 + x^{30} + ... + x^{180})}{(1-x^{210})^{4}}</cmath> | ||
+ | |||
+ | Notice to obtain a <math>x^{2022}</math> value, the <math>x^{42}</math> must be used, so we can reduce the problem to finding the coefficient of <math>x^{1980}</math> in | ||
+ | |||
+ | <cmath>\frac{(1 + x^{105})(1 + x^{70} + x^{140})(1 + x^{30} + ... + x^{180})}{(1-x^{210})^{4}}</cmath> | ||
+ | |||
+ | If <math>(1 - x^{210})^{-4}</math> is expanded, it will only generate multiples of 210. To compensate this, notice <math>1980 \equiv 90 \pmod{210}</math>, which means we need terms with a power of a 90 to acheive what we want (300 and larger values can be shown to be impossible upon inspection). This implies that the first two brackets do not contribute and we are left with | ||
+ | |||
+ | <cmath>\frac{x^{90}}{(1-x^{210})^{4}}</cmath> | ||
+ | |||
+ | This reduces to finding the coefficient of <math>x^{1890}</math> for the expansion <math>(1 - x^{210})^{-4}</math>, which is <math>\binom{12}{3} = \fbox{220}</math> | ||
+ | |||
+ | ==Solution 5 (Similar to solution 1)== | ||
+ | Expand the numerator and divide each term in the denominator separately to get | ||
+ | <math>(1+x^{30}+x^{60}+\dots)\cdot | ||
+ | (1+x^{42}+x^{84}+\dots)\cdot(1+x^{70}+x^{140}+\dots)</math> | ||
+ | <math>\cdot (1+x^{105}+x^{210}+\dots) (x^{2310}-1)^{2}</math> | ||
+ | Since the factor of <math>(x^{2310}-1)^{2}</math> is too big so we choose the -1 from both the 2 factors to get a 1. | ||
+ | So now we need to find the number of quadruples of | ||
+ | non negative integers <math>(a,b,c,d)</math> such that | ||
+ | <math>\textbf{105a + 70b + 42c + 30d = 2022}</math>. | ||
+ | By considering modulo <math>2</math>, <math>3</math>, <math>5</math>, <math>7</math> we can reduce the above expression to something that can be solved using stars-and-bars. | ||
+ | |||
+ | <math>a \equiv 0 \pmod 2</math> <math>b \equiv 0 \pmod 3</math> <math>c \equiv 1 \pmod 5</math> <math>d \equiv 3 \pmod7</math>. | ||
+ | Now we put in <math>a=2x</math>, <math>b=3y</math>, <math>c=5z+1</math> and <math>d=7w+3</math> to get | ||
+ | <math>2022 = 210(x+y+z+w) + 132</math> | ||
+ | <math>\Rightarrow \boxed{x+y+z+w=9},\; x,y,z,w\geq0</math> | ||
+ | By stars-and-bars the answer is <math>\binom{9+4-1}{4-1} = \boxed{\textbf{220}}</math>. | ||
+ | |||
+ | ~Lakshya Pamecha | ||
+ | |||
+ | ==Video Solution== | ||
+ | https://youtu.be/v2SFCqWOBjs | ||
+ | |||
+ | ~MathProblemSolvingSkills.com | ||
+ | |||
+ | ==Video Solution by The Power of Logic== | ||
+ | https://youtu.be/oJ1witTvG3A | ||
==See Also== | ==See Also== |
Latest revision as of 00:50, 10 May 2024
Contents
Problem
There is a polynomial with integer coefficients such thatholds for every Find the coefficient of in .
Solution 1
Because , we have
Denote by the coefficient of . Thus,
Now, we need to find the number of nonnegative integer tuples that satisfy
Modulo 2 on Equation (1), we have . Hence, we can write . Plugging this into (1), the problem reduces to finding the number of nonnegative integer tuples that satisfy
Modulo 3 on Equation (2), we have . Hence, we can write . Plugging this into (2), the problem reduces to finding the number of nonnegative integer tuples that satisfy
Modulo 5 on Equation (3), we have . Hence, we can write . Plugging this into (3), the problem reduces to finding the number of nonnegative integer tuples that satisfy
Modulo 7 on Equation (4), we have . Hence, we can write . Plugging this into (4), the problem reduces to finding the number of nonnegative integer tuples that satisfy
The number of nonnegative integer solutions to Equation (5) is .
~Steven Chen (www.professorchenedu.com)
Solution 2
Note that . Since the only way to express in terms of , , , or is , we are essentially just counting the number of ways to express in terms of these numbers. Since , it can only be expressed as a sum in terms of only one of the numbers (, , , or ). Thus, the answer is (by sticks and stones)
~Bigbrain123
Solution 3
We know that . Applying this, we see that The last factor does not contribute to the term, so we can ignore it. Thus we only have left to solve the equation , and we can proceed from here with Solution 1.
~MathIsFun286
Solution 4 (Generating Function Bash)
Essentially we want the coefficient of in the expansion
As does not contribute to the expansion, we omit it.
Notice , so we can rewrite the generating function as
Notice to obtain a value, the must be used, so we can reduce the problem to finding the coefficient of in
If is expanded, it will only generate multiples of 210. To compensate this, notice , which means we need terms with a power of a 90 to acheive what we want (300 and larger values can be shown to be impossible upon inspection). This implies that the first two brackets do not contribute and we are left with
This reduces to finding the coefficient of for the expansion , which is
Solution 5 (Similar to solution 1)
Expand the numerator and divide each term in the denominator separately to get
Since the factor of is too big so we choose the -1 from both the 2 factors to get a 1. So now we need to find the number of quadruples of non negative integers such that . By considering modulo , , , we can reduce the above expression to something that can be solved using stars-and-bars.
.
Now we put in , , and to get
By stars-and-bars the answer is .
~Lakshya Pamecha
Video Solution
~MathProblemSolvingSkills.com
Video Solution by The Power of Logic
See Also
2022 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 12 |
Followed by Problem 14 | |
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.