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

Home > Just Math
Oddly divisible (Posted on 2010-07-17) Difficulty: 3 of 5
Let S= 1^k +2^k + +n^k.
Show that S is divisible by 1+2+ +n for any integer n and odd k.

No Solution Yet Submitted by Ady TZIDON    
Rating: 3.3333 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution re: Proof for n even....for n odd, figure out - Got it! Comment 5 of 5 |
(In reply to Proof for n even....for n odd, figure out by pcbouhid)

Your proof for the divisibility into n+1 for even n can be modified for odd n.  Note that (n+1)/2 is an integer in this case. 


Group as before.  There will be (n-1)/2 pairs and one lone term:
[1^k + n^k] + [2^k + (n-1)^k] + ... + [((n-1)/2)^k + ((n+3)/2)^k] + [((n+1)/2)^k]

Each of the pairs is divisible by n+1 and the lone term is a power of (n+1)/2.  Therefore the entire sum is divisible by (n+1)/2.

Then for divisibility by n:
[1^k + (n-1)^k] + [2^k + (n-2)^k] + ... + [((n-1)/2)^k + ((n+1)/2)^k]^k + [n^k]

Each of these pairs is divisible by n and lone term is a power of n. Therefore the entire sum is divisible by n.

These two divisibilities combined prove the n is odd case.

  Posted by Brian Smith on 2016-06-27 11:55:49
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information