n numbers!

[SilverSprite]

The least number n of consecutive whole numbers, (n>1) that add up to 1000 is what?

[bugzpodder]

5

[SilverSprite]

show proof

[bugzpodder]

2 won't work, 3 won't work, 4 won't work, so 5

if you want to know if n would work, you figure out 1000/n

if n is even, 1000/n should get you k+0.5 where k is an integer and k+0.5 is the median of the consecutive integers (remember finite?)

if its odd, 1000/n should get you k, where k is an integer and of course, k is the mode.

i'll leave it to you as to how this works.

[SilverSprite]

good job