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.
Thanks for the solution.
I did same
Through a combinatorial approach , we find (AUBUC). For any 5 2 − n we can use (AUBUCU...N). I misclicked on "View Solution". :c 400 points lost. ;-;
but newton sum says :: S 1 = a 5 1 so why you have written S 1 + a 5 1 = 0 . It must be S 1 − a 5 1 = 0
Log in to reply
According to Newton's sums method, S 1 = − a 5 1 .
I found a solution I started using a while back which solves all problems of this type really easily.
Consider ∏ n = 1 5 2 ( 1 + y n ) . It should be clear that the coefficient of y k is equal to the coefficient of x 5 2 − k . An expansion of each of the expressions shows this. Hence, we should look for the coefficient of y 3 in the said expression. This proof uses the MacLaurin expansions of ln ( 1 + x ) and of e x .
Now. Consider the following: n = 1 ∏ 5 2 ( 1 + y n ) = exp ( ln n = 1 ∏ 5 2 ( 1 + y n ) ) = exp ( ln ( 1 + y ) + ln ( 1 + 2 y ) + ⋯ + ln ( 1 + 5 2 y ) ) = exp ( ( y − 2 y 2 + 3 y 3 − … ) + ( 2 y − 2 4 y 2 + 3 8 y 3 − … ) + ⋯ + ( 5 2 y − 2 5 2 2 y 2 + 3 5 2 3 y 3 − … ) ) = exp ( n = 1 ∑ 5 2 n y − 2 1 n = 1 ∑ 5 2 n 2 y 2 + 3 1 n = 1 ∑ 5 2 n 3 y 3 − … )
Define S k = k 1 ∑ n = 1 5 2 n k .
n = 1 ∏ 5 2 ( 1 + y n ) = exp ( S 1 y − S 2 y 2 + S 3 y 3 − … ) = e S 1 y × e − S 2 y 2 × e S 3 y 3 × … = ( 1 + ( S 1 y ) + 2 ( S 1 y ) 2 + 6 ( S 1 y ) 3 + … ) × ( 1 + ( − S 2 y 2 ) + 2 ( − S 2 y 2 ) 2 + 6 ( − S 2 y 2 ) 3 + … ) × ( 1 + ( S 3 y 3 ) + 2 ( S 3 y 3 ) 2 + 6 ( S 3 y 3 ) 3 + … ) × … = 1 + ( S 1 ) y + ( 2 S 1 2 − S 2 ) y 2 + ( 3 S 1 3 − S 1 S 2 + S 3 ) y 3 + …
And hence by comparison, the coefficient of the expression we're looking for is 3 S 1 3 − S 1 S 2 + S 3 . By using the sum of powers, we get S 1 = 1 3 7 8 , S 2 = 2 4 1 1 5 , S 3 = 3 1 8 9 8 8 8 4 and thus by direct calculation, we get our coefficient of x 4 9 to be 4 0 3 5 1 2 8 5 0 .
Interesting. Thanks for the solution.
The terms with x 4 9 are of the form a ⋅ b ⋅ c ⋅ x 4 9 , where 1 ≤ a < b < c ≤ 5 2 .
My strategy for adding all these products a ⋅ b ⋅ c together is as follows:
First, allow a , b , c to range over all values from 1 to 52.
Then subtract all triples of the form ( a , a , b ) , ( a , b , a ) , and ( b , a , a ) .
In the previous step, when a = b we have subtracted the same triple three times instead of once. Therefore add back in twice all triples of the form ( a , a , a ) .
Now we have all triples with a = b = c = a , but each triple in all of its six permutations. Therefore divide the result by 6.
Step 1 : Sum of all products a ⋅ b ⋅ c . This is a = 1 ∑ 5 2 b = 1 ∑ 5 2 c = 1 ∑ 5 2 a b c = ( a = 1 ∑ 5 2 a ) ⋅ ( b = 1 ∑ 5 2 b ) ⋅ ( c = 1 ∑ 5 2 c ) = ( a = 1 ∑ 5 2 a ) 3 ; this is equal to ( 2 5 2 ⋅ 5 3 ) 3 = 2 6 1 6 6 6 2 1 5 2 .
Step 2 : Sum of all products a ⋅ a ⋅ b . This is a = 1 ∑ 5 2 b = 1 ∑ 5 2 a 2 b = ( a = 1 ∑ 5 2 a 2 ) ⋅ ( b = 1 ∑ 5 2 b ) = ( 6 5 2 ⋅ 5 3 ⋅ 1 0 5 ) ⋅ ( 2 5 2 ⋅ 5 3 ) = 6 6 4 6 0 9 4 0 .
Step 3 : Sum of all products a ⋅ a ⋅ a . This is a = 1 ∑ 5 2 a 3 = ( a = 1 ∑ 5 2 a ) 2 = ( 2 5 2 ⋅ 5 3 ) 2 = 1 8 9 8 8 8 4 .
Step 4 : Sum of all products a ⋅ b ⋅ c with all different numbers: 2 6 1 6 6 6 2 1 5 2 − 3 × 6 6 4 6 0 9 4 0 + 2 × 1 8 9 8 8 8 4 = 2 4 2 1 0 7 7 1 0 0 ; divide by six to have sum of all products a ⋅ b ⋅ c with a < b < c : 6 2 4 2 1 0 7 7 1 0 0 = 4 0 3 5 1 2 8 5 0 .
Note: This can be generalized, of course. Replacing 52 by n , define S 1 = a = 1 ∑ n a = 2 n ( n + 1 ) ; S 2 = a = 1 ∑ n a 2 = 6 n ( n + 1 ) ( 2 n + 1 ) = 3 2 n + 1 S 1 ; S 3 = a = 1 ∑ n a 3 = S 1 2 ; the values for steps 1, 2, and 3 become N 1 = S 1 3 ; N 2 = S 2 S 1 = 3 2 n + 1 S 1 3 ; N 3 = S 1 2 so that the answer is N = 6 N 1 − 3 N 2 + 2 N 3 = 6 1 S 1 2 ⋅ ( S 1 − ( 2 n + 1 ) + 2 ) = 6 1 S 1 2 ( S 1 − 2 n + 1 ) . In our case, S 1 = 1 3 7 8 ; N = 6 1 ⋅ 1 3 7 8 2 ⋅ 1 2 7 5 = 4 0 3 5 1 2 8 5 0 .
Start with F 2 ( N ) = 1 ≤ r < s ≤ N + 1 ∑ r s = = s = 2 ∑ N + 1 s ( r = 1 ∑ s − 1 r ) = 2 1 s = 2 ∑ N + 1 s ( s − 1 ) s 2 1 s = 1 ∑ N s ( s + 1 ) 2 = 2 4 1 N ( N + 1 ) ( N + 2 ) ( 3 N + 5 ) then F 3 ( N ) = 1 ≤ r < s < t ≤ N + 2 ∑ r s t = + 1 ≤ r < s ≤ N + 1 ∑ r s ( t = s + 1 ∑ N + 2 t ) 2 1 ( N + 2 ) ( N + 3 ) F 2 ( N ) − 2 1 1 ≤ r < s ≤ N + 1 ∑ r s 2 ( s + 1 ) and 1 ≤ r < s ≤ N + 1 ∑ r s 2 ( s + 1 ) = = = = s = 2 ∑ N + 1 s 2 ( s + 1 ) ( r = 1 ∑ s − 1 r ) = 2 1 s = 2 ∑ N + 1 ( s − 1 ) s 3 ( s + 1 ) 2 1 s = 1 ∑ N s ( s + 1 ) 3 ( s + 2 ) 2 1 s = 1 ∑ N [ s ( s + 1 ) ( s + 2 ) ( s + 3 ) ( s + 4 ) − 5 s ( s + 1 ) ( s + 2 ) ( s + 3 ) + 4 s ( s + 1 ) ( s + 2 ) ] 2 1 ⎣ ⎡ 6 1 N ( N + 1 ) ( N + 2 ) ( N + 3 ) ( N + 4 ) ( N + 5 ) − N ( N + 1 ) ( N + 2 ) ( N + 3 ) ( N + 4 ) + N ( N + 1 ) ( N + 2 ) ( N + 3 ) ⎦ ⎤ Putting all these together, we obtain F 3 ( N ) = 4 8 1 N ( N + 1 ) ( N + 2 ) 2 ( N + 3 ) 2 The answer to the question is F 3 ( 5 0 ) = 4 0 3 5 1 2 8 5 0 .
Thanks for the solution.
Log in to reply
Actually, it works more easily like this: F 3 ( N ) = = = = 2 ≤ s < t ≤ N + 2 ∑ s t ( r = 1 ∑ s − 1 r ) = 2 1 2 ≤ s < t ≤ N + 2 ∑ ( s − 1 ) s 2 t 2 1 1 ≤ s < t ≤ N + 1 ∑ s ( s + 1 ) 2 ( t + 1 ) = 2 1 t = 2 ∑ N + 1 ( t + 1 ) ( s = 1 ∑ t − 1 s ( s + 1 ) 2 ) 2 4 1 t = 2 ∑ N + 1 ( t − 1 ) t ( t + 1 ) 2 ( 3 t + 2 ) = 2 4 1 t = 1 ∑ N t ( t + 1 ) ( t + 2 ) 2 ( 3 t + 5 ) 4 8 1 N ( N + 1 ) ( N + 2 ) 2 ( N + 3 ) 2
Log in to reply
Actually, wouldnt it work much more easier with newton's sums...?
Log in to reply
@Manuel Kahayon – Yes, much easier... Since the roots of the polynomial j = 1 ∏ n ( x + j ) = j = 0 ∑ n a j x j are − 1 , − 2 , … , − n , we have P 1 P 2 P 3 = = = j = 1 ∑ n ( − j ) = − 2 1 n ( n + 1 ) j = 1 ∑ n ( − j ) 2 = 6 1 n ( n + 1 ) ( 2 n + 1 ) j = 1 ∑ n ( − j ) 3 = − 4 1 n 2 ( n + 1 ) 2 and so the coefficient we want is a n − 3 = = = = 3 1 [ − P 3 + 2 3 P 1 P 2 − 2 1 P 1 3 ] 1 2 1 n 2 ( n + 1 ) 2 − 2 4 1 n 2 ( n + 1 ) 2 ( 2 n + 1 ) + 4 8 1 n 3 ( n + 1 ) 3 4 8 1 n 2 ( n + 1 ) 2 [ 4 − 2 ( 2 n + 1 ) + n ( n + 1 ) ] 4 8 1 ( n − 2 ) ( n − 1 ) n 2 ( n + 1 ) 2 . This time, put n = 5 2 .
Log in to reply
@Mark Hennings – Thanks for the solution again.
@Manuel Kahayon – Can you write a solution?
Log in to reply
@Chew-Seong Cheong – I'll try...
Log in to reply
@Manuel Kahayon – Mark Hennings has provide the solution.
@Chew-Seong Cheong – Woop! I think I got now the solution using Newton's Sums . And it's very similar to Mark Hennings' solution. :)
@Chew-Seong Cheong – And I must say, the following formulas helped me on getting the answer using the Newton's Sums .
1 2 + 2 2 + 3 2 + . . . + k 2 = 6 k ( k + 1 ) ( 2 k + 1 )
and
1 3 + 2 3 + 3 3 + . . . + k 3 = [ 2 k ( k + 1 ) ] 2
Does this work for all n?
The coefficients of a polynomial P ( x ) P ( x ) : = k = 0 ∑ n a k x k = k = 1 ∏ n ( x − x k ) , a k , x k ∈ C , a n = 1
satisfy a recurrence relation we can get if we rewrite the initial condition of Newton's Identities in matrix form: ⎝ ⎜ ⎜ ⎜ ⎛ n S 1 ⋱ … ⋱ 1 S n ⋮ S 1 1 ⎠ ⎟ ⎟ ⎟ ⎞ ⋅ ⎝ ⎜ ⎜ ⎜ ⎛ a 0 ⋮ a n − 1 a n ⎠ ⎟ ⎟ ⎟ ⎞ = ⎝ ⎜ ⎜ ⎜ ⎛ 0 ⋮ 0 1 ⎠ ⎟ ⎟ ⎟ ⎞ , S i = k = 1 ∏ n x k i
Now to the task. For simplicity, let n = 5 2 , so we need to find a n − 3 and only need the lower right 4 × 4 corner of the recurrence relation containing S 1 , S 2 , S 3 . Our polynomial has the roots x k = − k and we get S 1 = k = 1 ∑ n ( − k ) = − 2 n ( n + 1 ) , S 2 = k = 1 ∑ n ( − k ) 2 = 6 n ( n + 1 ) ( 2 n + 1 ) , S 3 = k = 1 ∑ n ( − k ) 3 = − 4 n 2 ( n + 1 ) 2 We solve these four equations from bottom to top and obtain a n − 1 = 2 n ( n + 1 ) , a n − 2 = 2 4 ( n − 1 ) n ( n + 1 ) ( 3 n + 2 ) , a n − 3 = 4 8 ( n − 2 ) ( n − 1 ) n 2 ( n + 1 ) 2 The special case n = 5 2 leads to a 4 9 = 4 0 3 5 1 2 8 5 0
Problem Loading...
Note Loading...
Set Loading...
Obviously, the product above is equal to ( n ) ( n + 1 ) ( n + 2 ) ⋯ ( n + 5 2 )
Let P ( x ) = ( n ) ( n + 1 ) ( n + 2 ) ⋯ ( n + 5 2 ) Then, obviously, P ( x ) has roots − 1 , − 2 , − 3 , ⋯ − 5 2
First, let us find the sums of all the roots, the sums of the squares of the roots and the sums of the cubes of the roots.
Obviously, the sum of the roots of the equation is equal to − 1 − 2 − 3 ⋯ − 5 2 or − ( 1 + 2 + 3 + ⋯ 5 2 )
This is equal to − 2 ( 5 2 ) ( 5 3 ) = − 1 3 7 8
Similarly, we get the sum of the squares of the roots ( − 1 ) 2 + ( − 2 ) 2 + ( − 3 ) 2 + ⋯ + ( − 5 2 ) 2 = 1 2 + 2 2 + 3 2 + ⋯ + 5 2 2 = 6 ( 5 2 ) ( 5 3 ) ( 1 0 5 ) = 4 8 2 3 0
Also, the sum of the cubes of the roots are ( − 1 ) 3 + ( − 2 ) 3 + ( − 3 ) 3 + ⋯ + ( − 5 2 ) 3 = − ( 1 3 + 2 3 + 3 3 + ⋯ + 5 2 2 ) = − ( 2 ( 5 2 ) ( 5 3 ) ) 2 = − 1 8 9 8 8 8 4
Now, finally, we can proceed with the Newton's sums part.
Since P ( x ) = x 5 2 + a 5 1 x 5 1 + a 5 0 x 5 0 + a 4 9 x 4 9 + ⋯ + a 0 , then by Newton's sums,
S 1 + a 5 1 = 0
S 2 + S 1 a 5 1 + 2 a 5 0 = 0
S 3 + S 2 a 5 1 + S 1 a 5 0 + 3 a 4 9 = 0
Where S n = i = 1 ∑ 5 2 x i n
Solving for the variables a 5 1 , a 5 0 , a 4 9 ,
S 1 + a 5 1 = 0
a 5 1 = 1 3 7 8
S 2 + S 1 a 5 1 + 2 a 5 0 = 0
a 5 0 = 9 2 5 3 2 7
S 3 + S 2 a 5 1 + S 1 a 5 0 + 3 a 4 9 = 0
a 4 9 = 4 0 3 5 1 2 8 5 0
Where the equations above were solved by simple substitution and use of calculator.
So, we get a 4 9 = 4 0 3 5 1 2 8 5 0