All power sums have a closed polynomial forms for integral powers. For example,
1 2 + 2 2 + 3 2 + ⋯ + n 2 = k = 1 ∑ n k 2 = 3 n 3 + 2 n 2 + 6 n
More generally
1 m + 2 m + 3 m + ⋯ + n m = k = 1 ∑ n k m = i = 1 ∑ m + 1 a i n i
In the case of m = 2 , a 1 = 6 1 , a 2 = 2 1 , and a 3 = 3 1 .
When m = 2 0 , if a 5 can be written as q − p for coprime positive integers p , q , find p + q .
Tip: This might help :)
Like this problem? Try these too:
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.
Take the bottom left half of Pascal's infinite matrix (linked in the problem to a google spread sheet). Remove the top left-bottom right diagonal of 1's. Remove the top row and right most column of 0's. Invert the matrix. The jth row from the right yields the coefficients of the sum of (j-1)th powers. This is proved in this document .
Problem Loading...
Note Loading...
Set Loading...
A power sum is given by k = 1 ∑ n k p = k = 1 ∑ p + 1 b p k n k ( ref: eqn (17) ), whose coefficient b p k = k ! ( p − k + 1 ) ! ( − 1 ) p − k + 1 B p − k + 1 p ! ( ref: eqn (18) ), where B m is a Bernoulli number .
For p = m = 2 0 , we have b 2 0 , i = a i and:
a 5 = b 2 0 , 5 = 5 ! ( 2 0 − 5 + 1 ) ! ( − 1 ) 2 0 − 5 + 1 B 2 0 − 5 + 1 2 0 ! = 5 ! 1 6 ! ( − 1 ) 1 6 B 1 6 2 0 ! = − 5 1 0 9 6 9 ⋅ 3 6 1 7 = − 1 0 6 8 7 2 3 Note that B 1 6 = − 5 1 0 3 6 1 7
⟹ p + q = 6 8 7 2 3 + 1 0 = 6 8 7 3 3