All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Front to back (Posted on 2007-03-18) Difficulty: 3 of 5
Suppose one sequence is formed by multiplying termwise the sequence 1,2,...n by the sequence n,n-1,...1 and another sequence is formed by multiplying termwise the sequence 2,4,...n by the sequence 2,4,...n.

Show that for even n, the sum of each sequence is the same.

No Solution Yet Submitted by Gamer    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution induction | Comment 2 of 3 |
It is easily tru for n=0 (both sums =0)

Now for n+2

Sum1(n+2) = sum1(n) + 2*sum(i=1..n)(i) + n+2 + 2(n+1)

(each term increases by two + two new terms)

=sum1(n) + n(n+1) + 3n + 4 = sum1(n) + n+4n+4
=sum2(n) + (n+2) = sum2(n+2)

so by induction it is proven for all even n >=0

(sum2 substitution by inductive hypothesis)

  Posted by Joel on 2007-03-18 13:16:00
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information