It is said that, as a child, Gauss completed the tedious assignment of adding the first one hundred natural numbers in a few seconds by realizing that 1 + 1 0 0 = 2 + 9 9 = … = 5 0 + 5 1 , so the answer must be 5 0 × 1 0 1 = 5 0 5 0 , since there are 50 such couples.
For the first n natural numbers, the expression is: k = 1 ∑ n k = 2 n ( n + 1 )
We know that the sum of the first n cubes takes the form: k = 1 ∑ n k 3 = A n 2 + B n 3 + C n 4
Find the coefficients A , B and C . Express the solution as A 1 + B 1 + C 1 .
Bonus : Factor the polynomial and compare it with 2 n ( n + 1 ) to find a beautiful identity that relates both sums!
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.
But how does one know that the formula k = 1 ∑ n k 3 = A n 2 + B n 3 + C n 4 work for all positive integer n ?
Log in to reply
Well, I don't know. I need your support here.
Log in to reply
Use finite difference to show that k = 1 ∑ n k p is a polynomial of n in degree p + 1 .
Problem Loading...
Note Loading...
Set Loading...
The coefficients A , B and C satisfy the following system of linear equations: ⎩ ⎪ ⎨ ⎪ ⎧ n = 1 : 1 2 A + 1 3 B + 1 4 C = 1 3 n = 2 : 2 2 A + 2 3 B + 2 4 C = 1 3 + 2 3 n = 3 : 3 2 A + 3 3 B + 3 4 C = 1 3 + 2 3 + 3 3 The solution is: A = 4 1 , B = 2 1 , C = 4 1 . Expressed in the form demanded, the answer is A 1 + B 1 + C 1 = 1 0 .
Bonus : The solution polynomial 4 1 n 2 + 2 1 n 3 + 4 1 n 4 can be easily factored as 4 n 2 ( n + 1 ) 2 , which is the square of the sum of the the first n natural numbers. The identity referred to is then: 1 3 + 2 3 + … + n 3 = ( 1 + 2 + … + n ) 2 Isn't it beautiful!