A Challenge Problem in Techniques Of Problem Solving

AK2
Messages
39
Reaction score
0
I just need a hint to solve the problem. The method used is illustrated in the example problem as follows:

Assume that k is a positive integer . What is the sum of integers
S = 1+2+3+...+(k-1)+k?

Solution:

22 - 12 = 3 = 2 * 1 + 1
32 - 22 = 5 = 2 * 2 + 1
42 - 32 = 7 = 2 * 3 + 1
...
k2 - (k-1)2 = 2 * (k-1) + 1
(k+1)2 - k2 = 2 * k + 1

Now we add the columns:
[22 - 12] + [32 - 22] +...+ [(k+1)2 - k2]
= [2 * 1+1] + [2*2+1] + [2*3+1]+...+[2*k+1]

The left hand side ''telescopes'' (that is, all but the first and last terms cancel) and the right side may be factored. The result is

(k+1)2 - 12 = 2[1+2+3+...k] + [1+1+1+...+1]
k times
or
k2 + 2 * k = 2 * S + k

Solving for S for we find that

S = (k2+k)/2

I am supposed to imitate the method used in the example problem to solve the challenge problem in the book as follows

Imitate the method used in the last problem to find a formula for the sum
12 + 22 + 32 + ... + k2

when k is a positive integer.

I have tried various things like (a+1)4 - a4, (a+1)3 - a3, triangle numbers, odd numbers, but I haven't been able to solve it. I just need a hint. This is not a homework problem. This is self study.
 
Physics news on Phys.org
Use

(k+1)^3 - k^3 = 3k^2+3k+1

and do summation on both side. By telescoping method, only 2 terms left in the left hand side. You need to do a little manipulation on the right hand side though.
 
Why not like the Contiguous Numbers: for example,P=1+2+3+4+5...+100 and the answer of P is (1+100)*100/2 , so the S=(1+k)*k/2
 
ross_tang said:
Use

(k+1)^3 - k^3 = 3k^2+3k+1

and do summation on both side. By telescoping method, only 2 terms left in the left hand side. You need to do a little manipulation on the right hand side though.

Thanks for the hint
I got my answer for S

S = (2k3+3k2+k)/6
 
You are right. You may want to do some factorization also.

S = \frac{ n(n+1)(2n+1)}{6}
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top