Power Sums: Coefficient Sum

Calculus Level 5

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 = n 3 3 + n 2 2 + n 6 1^2+2^2+3^2+\cdots+n^2=\displaystyle \sum_{k=1}^n k^2=\frac{n^3}{3}+\frac{n^2}{2}+\frac{n}{6}

More generally

1 m + 2 m + 3 m + + n m = k = 1 n k m = i = 1 m + 1 a i n i 1^m+2^m+3^m+\cdots+n^m=\displaystyle \sum_{k=1}^n k^m=\displaystyle \sum_{i=1}^{m+1} a_i n^i

In the case of m = 2 m=2 , a 1 = 1 6 a_1=\frac{1}{6} , a 2 = 1 2 a_2=\frac{1}{2} , and a 3 = 1 3 a_3=\frac{1}{3} .


When m = 864 m=864 , if i = 1 864 a i \displaystyle \sum_{i=1}^{864} a_i can be written as p q \dfrac{p}{q} for coprime positive integers p , q p,q , find p + q p+q .


Like this problem? Try these too.


The answer is 1729.

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.

2 solutions

Trevor Arashiro
Feb 23, 2017

The sum of the coefficients of all power sums is 1. (hint, plug in n=1)

However, in this problem, we are missing a 865 a_{865} . The lead coefficient of the closed form of the sum of mth powers is 1 m + 1 \frac{1}{m+1} . Thus

1 1 865 = 864 865 864 + 865 = 1729 1-\frac{1}{865}=\frac{864}{865}\Longrightarrow 864+865=\boxed{1729}

Apologies to anyone who answered 201. I thought I changed the problem to 864 but the only explanation I have as to why it didn't change is that I didn't hit save? I might have only hit preview.

Trevor Arashiro - 4 years, 3 months ago

i only induced that a 865 = 1 865 a_{865}=\frac{1}{865} have u a more powerful proof?

Rohith M.Athreya - 4 years, 3 months ago

Log in to reply

Suppose that some polynomial h ( x ) h(x) exists such that h ( a ) h ( a 1 ) = a m h(a)-h(a-1)=a^m . Then k = 1 n k m = h ( n ) h ( 0 ) \sum_{k=1}^n k^m=h(n)-h(0) . Next, assume h ( 0 ) = 0 h(0)=0 (you can actually assume h(0)=anything).

This means that h ( n ) h(n) is the closed form of the polynomial solution that we desire. Looking back at h ( a ) h ( a 1 ) = a m h(a)-h(a-1)=a^m , if we assume that h ( n ) h(n) is a polynomial of degree m+1, we can write the first few terms as ( \large{(} a m + 1 n m + 1 + a m n m + . . . . . . a_{m+1}n^{m+1}+a_{m}n^m+...... ) \large{)} - ( \large{(} a m + 1 ( n 1 ) m + 1 + a m ( n 1 ) m + . . . . a_{m+1}(n-1)^{m+1}+a_m(n-1)^{m}+.... ) \large{)} = n m =n^m

If we look at the coefficients of n m n^m , we get a m + 1 ( m + 1 1 ) n m = n m a_{m+1}\binom{m+1}{1}n^m=n^m . It is quite clear that the lead coefficient must be 1 m + 1 \frac{1}{m+1}

Trevor Arashiro - 4 years, 3 months ago

Log in to reply

Thank you!

Rohith M.Athreya - 4 years, 3 months ago
Chew-Seong Cheong
Feb 27, 2017

A power sum is given by k = 1 n k p = k = 1 p + 1 b p k n k \displaystyle \sum_{k=1}^n k^p = \sum_{k=1}^{p+1} b_{pk} n^k ( ref: eqn (17) ), whose coefficient b p k = ( 1 ) p k + 1 B p k + 1 p ! k ! ( p k + 1 ) ! b_{pk} = \dfrac {(-1)^{p-k+1}B_{p-k+1}p!}{k!(p-k+1)!} ( ref: eqn (18) ), where B m B_m is a Bernoulli number . And that k = 1 p + 1 b p k = 1 \displaystyle \sum_{k=1}^{p+1} b_{pk} = 1 ( ref: eqn (19) ).

For p = m = 864 p=m=864 , we have b 864 , i = a i b_{864,i} = a_i and:

i = 1 864 a i = i = 1 865 a i a 865 = 1 a 865 = 1 b 864 , 865 = 1 ( 1 ) 864 865 + 1 B 864 865 + 1 864 ! 865 ! ( 864 865 + 1 ) ! = 1 ( 1 ) 0 B 0 864 ! 865 ! 0 ! Note that B 0 = 1 = 1 1 865 = 864 865 \begin{aligned} \sum_{i=1}^{864} a_i & = \sum_{i=1}^{\color{#D61F06}865} a_i - a_{\color{#D61F06}865} \\ & = 1 - a_{\color{#D61F06}865} \\ & = 1 - b_{864,865} \\ & = 1 - \frac {(-1)^{864-865+1}B_{864-865+1}864!}{865!(864-865+1)!} \\ & = 1 - \frac {(-1)^0{\color{#3D99F6}B_0}864!}{865!0!} & \small \color{#3D99F6} \text{Note that } B_0 = 1 \\ & = 1 - \frac 1{865} \\ & = \frac {864}{865} \end{aligned}

p + q = 864 + 865 = 1729 \implies p+q = 864+865 = \boxed{1729}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...