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.)
re: I do not wish to quibble, but... | Comment 3 of 5 |
(In reply to I do not wish to quibble, but... by Dej Mar)



I honestly do not consider it "quibbling " and  classify remarks like yours as productive and aimed at

 improving the accuracy of the problems being posted However   I would like to point out the following:

The right time to post your criticism is during the review period (open to Sch &Jm),  since now there is no way to add/erase/edit the posted stuff anyway.

Addressing the issues raised by you:, I would have gladly added a small waiver like  (k>0) , but deem  it unnecessary for n, as no person would have considered  negative values

in a ascending series defined explicitly  as 1,2,3  ,n


I  hope that the small omission still present does not prevent solving the problem correctly.




Edited on July 20, 2010, 4:27 am
  Posted by Ady TZIDON on 2010-07-20 04:23:26

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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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