Consider the polynomial
i = 1 ∏ 6 ( 1 + x 3 i + i x 2 ⋅ 3 i ) .
What is the coefficient of x 2 0 1 3 ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
minor typo: x 2 0 1 3 should be x 2 0 1 3 .
We write out the product: ( 1 + x 3 + x 6 ) ( 1 + x 9 + 2 x 1 8 ) ( 1 + x 2 7 + 3 x 5 4 ) ( 1 + x 8 1 + 4 x 1 6 2 ) ( 1 + x 2 4 3 + 5 x 4 8 6 ) ( 1 + x 7 2 9 + 6 x 1 4 5 8 ) Now, consider the final term of the product. To get powers that add to 2013, we must take 6 x 1 4 5 8 . Otherwise, we get a maximum of 729+486+162+54+18+6=1455. We now add 2013-1458=555 to the exponent. ( 1 + x 3 + x 6 ) ( 1 + x 9 + 2 x 1 8 ) ( 1 + x 2 7 + 3 x 5 4 ) ( 1 + x 8 1 + 4 x 1 6 2 ) ( 1 + x 2 4 3 + 5 x 4 8 6 ) ( 6 x 1 4 5 8 ) Consider the fifth term. If we do not use 5 x 4 8 6 , we can only get a total exponent of 243+162+54+18+6=483. Therefore, we must use 5 x 4 8 6 , and must add 555-486=69 to the exponent. ( 1 + x 3 + x 6 ) ( 1 + x 9 + 2 x 1 8 ) ( 1 + x 2 7 + 3 x 5 4 ) ( 1 + x 8 1 + 4 x 1 6 2 ) ( 5 x 4 8 6 ) ( 6 x 1 4 5 8 ) In the fourth term in the product, we must clearly use the 1. ( 1 + x 3 + x 6 ) ( 1 + x 9 + 2 x 1 8 ) ( 1 + x 2 7 + 3 x 5 4 ) ( 1 ) ( 5 x 4 8 6 ) ( 6 x 1 4 5 8 ) In the third term of the product, if we don't use 3 x 5 4 , we can only achieve an exponent of 27+18+6=51. Therefore, we must use 3 x 5 4 , and must add 69-54=15 to the exponent. ( 1 + x 3 + x 6 ) ( 1 + x 9 + 2 x 1 8 ) ( 3 x 5 4 ) ( 1 ) ( 5 x 4 8 6 ) ( 6 x 1 4 5 8 ) Now, it is clear we must use x 6 and x 9 . Therefore, there is only one way to get a power of 2013 on x . ( x 6 ) ( x 9 ) ( 3 x 5 4 ) ( 1 ) ( 5 x 4 8 6 ) ( 6 x 1 4 5 8 ) The answer is 3 ⋅ 5 ⋅ 6 = 9 0 .
Not that I disagree with your logic, but I think you would make things a little easier on yourself if you note that 2 0 1 3 = 2 2 0 2 1 2 0 3 .
Log in to reply
clever bijection
Oops, that is true. Oh well, my method didn't actually take that long, it just took a very long time to write out.
very clear and easy to understand. I was trying to do this only but got struck somewhere.VERY GOOD
this is the way that I use,just messier
Firstly, we write 2 0 1 3 = 2 ⋅ 3 6 + 2 ⋅ 3 5 + 0 ⋅ 3 4 + 2 ⋅ 3 3 + 1 ⋅ 3 2 + 2 ⋅ 3 1 . Note that this representation is unique, and corresponds to multiplying 6 ⋅ x 2 ⋅ 3 6 , 5 ⋅ x 2 ⋅ 3 5 , 1 , ..., x 2 ⋅ 3 1 . Clearly, the coefficient of x 2 0 1 3 is 6 ⋅ 5 ⋅ 1 ⋅ 3 ⋅ 1 ⋅ 1 = 9 0 .
i = 1 ∐ 6 ( 1 + x 3 i + i x 2 ⋅ 3 i )
= i = 1 ∐ 6 ( x 0 ⋅ 3 i + x 1 ⋅ 3 i + i x 2 ⋅ 3 i ) ,
= ∑ x k 1 ⋅ 3 1 + k 2 ⋅ 3 2 + k 3 ⋅ 3 3 + k 4 ⋅ 3 4 + k 5 ⋅ 3 5 + k 6 ⋅ 3 6
at which { 0 ; 1 ; 2 } ∋ k i is a coefficient of 3 i in the exponents of terms in the sum ( x 0 ⋅ 3 i + x 1 ⋅ 3 i + i x 2 ⋅ 3 i ) .
Assume x k 1 ⋅ 3 1 + k 2 ⋅ 3 2 + k 3 ⋅ 3 3 + k 4 ⋅ 3 4 + k 5 ⋅ 3 5 + k 6 ⋅ 3 6 = x 2 0 1 3
⇔ k 1 ⋅ 3 0 + k 2 ⋅ 3 1 + k 3 ⋅ 3 2 + k 4 ⋅ 3 3 + k 5 ⋅ 3 4 + k 6 ⋅ 3 5 = 6 7 1
Because the way a number is shown in a counting system is unique,
and { k 1 ⋅ 3 0 + k 2 ⋅ 3 1 + k 3 ⋅ 3 2 + k 4 ⋅ 3 3 + k 5 ⋅ 3 4 + k 6 ⋅ 3 ( 1 0 ) 5 = k 6 k 5 k 4 k 3 k 2 k 1 ( 3 ) 6 7 1 ( 1 0 ) = 2 2 0 2 1 2 ( 3 ) ,
so that k 1 = 2 , k 2 = 1 , k 3 = 2 , k 4 = 0 , k 5 = 2 , k 6 = 2 .
Infer the coefficient of x 2 0 1 3 is 1 ⋅ 1 ⋅ 3 ⋅ 1 ⋅ 5 ⋅ 6 = 9 0 .
To observe things easier, we rewrite the expression as ( 1 + x 3 + x 6 ) ( 1 + x 9 + 2 x 1 8 ) ( 1 + x 2 7 + 3 x 5 4 ) ( 1 + x 8 1 + 4 x 1 6 2 ) ( 1 + x 2 4 3 + 5 x 4 8 6 ) ( 1 + x 7 2 9 + 6 x 1 4 5 8 )
In the expansion, we select one term from each of the 6 brackets and multiply them together.
We will argue that the only way to get x 2 0 1 3 is to multiply the terms in x 6 , x 9 , x 5 4 , 1 , x 4 8 6 and x 1 4 5 8 together (one from each of the brackets). We do this by selecting the terms in the brackets from back to front.
Indeed, x 1 4 5 8 must be chosen, or else the maximum power of x we can get is only 6 + 1 8 + 5 4 + 1 6 2 + 4 8 6 + 7 2 9 = 1 4 5 5 , not enough to reach 2 0 1 3 .
Once x 1 4 5 8 is already chosen, the sum of the powers of the remaining terms must be 2 0 1 3 − 1 4 5 8 = 5 5 5 . Arguing similarly, the term x 4 8 6 must be chosen, or else we would only get a maximum power of 6 + 1 8 + 5 4 + 1 6 2 + 2 4 3 = 4 8 3 .
Thus, the total power of the rest of the terms is 5 5 5 − 4 8 6 = 6 9 . The only possible term with power less than 6 9 from the fourth bracket is 1 . Using the similar reasoning, the term in x 5 4 will be chosen from the third bracket. Till this point, the remaining powers we need is 2 0 1 3 − 1 4 5 8 − 4 8 6 − 5 4 = 1 5 , and the only way to get the power of 1 5 from the first two brackets is to multiply x 6 and x 9 .
Thus the term in x 2 0 1 3 is ( x 6 ) ( x 9 ) ( 3 x 5 4 ) ( 1 ) ( 5 x 4 8 6 ) ( 6 x 1 4 5 8 ) = 9 0 x 2 0 1 3 . The coefficient is 9 0
what i've done:
∏ i = 1 6 3 i = 3 − 1 3 7 − 1 = 1 0 9 3 and ∏ i = 1 6 2 ∗ 3 i = 3 7 − 1 = 2 1 8 6
we've ∏ i = 1 6 3 i = 3 − 1 3 7 − 1 < 2 0 1 3 so we choose 2 ∗ 3 6 = 1 4 5 8 , and we subtract it from 2 0 1 3 , gives us 2 0 1 3 − 2 ∗ 3 6 = 5 5 5
then ∏ i = 1 5 3 i = 3 − 1 3 6 − 1 < 5 5 5 we choose 2 ∗ 3 5 = 4 8 6 , and we subtract it from 5 5 5 , gives us 5 5 5 − 2 ∗ 3 5 = 6 9
we've 3 4 = 8 1 > 6 9 so we ignore implies we ignore also 2 ∗ 3 4
then ∏ i = 1 3 3 i = 3 − 1 3 4 − 1 < 6 9 we choose 2 ∗ 3 3 = 5 4 , we subtract it from 6 9 , gives us 6 9 − 2 ∗ 3 3 = 1 5
finally we've 2 ∗ 3 2 > 1 5 so we choose 3 2 and we subtract it from 1 5 to get 6 and 2 ∗ 3 1 = 6 .
k x 2 0 1 3 = 6 x 2 ∗ 3 6 ∗ 5 x 2 ∗ 3 5 ∗ 3 x 2 ∗ 3 3 ∗ x 3 2 ∗ 1 x 2 ∗ 3 1 so
k = 6 ∗ 5 ∗ 3 ∗ 1 = 9 0
Each factor can be written as x 0 . 3 i + x 1 . 3 i + i x 2 . 3 i . Then, each term at the expansion is determined uniquely by the 6 factors, depending on their representation in base 3. In other words, for x k , looking at the representation of k in base 3, we can infer how x k was formed, and there's only one way of doing so. Of course since k has to be a multiple of 3, then the last digit is zero, and we ignore it. For any digit corresponding to 3 i , if that digit is 0, then it must have come from the "1" term. If it's 1, then it must have come from the x 3 i term, and if it's 2, it must have come from i . x 2 . 3 i term, for that particular factor.
Note that each term contributes a coefficient of 1, except the i if it comes from i . x 2 . 3 i , so we need to only care for "2" in base 3 representation.
Next, we find 2013 in base 3, and that is 2202120. The twos belong to i = 1 , 3 , 5 , 6 so the coefficient is 1 . 3 . 5 . 6
Problem Loading...
Note Loading...
Set Loading...
Consider the exponents in base 3 . In each of the factors, the exponents are in the form of 1 0 . . . 0 or 2 0 . . . 0 . Since there are no 2 factors that have the same number of zeroes at the end of each exponent of x , the exponent of each term of x after the expansion would have a different base 3 representation than any other term. Hence there is only one term that has x 2 0 1 3 in it even after we expand but do not combine like terms.
Now we identify the coefficient of that term.
2 0 1 3 = 2 2 0 2 1 2 0 . The only coefficients in the factors that are not 1 s are the ones with an even exponent ). We multiply those coefficients to get ( 6 ) ( 5 ) ( 3 ) ( 1 ) = 9 0 . Hence the coefficient of x 2 0 1 3 is 9 0 .