Sum of n consecutive numbers is divisible by n

  • Thread starter Matt
  • Start date
  • #1
11
0
I'm trying to investigate this statement: The sum of n consecutive numbers is always divisible by n.

I've found already that it's only true when the total amount of numbers is an odd number. I've also found that the median and mean are the same with consecutive numbers. I can not prove that the it's only true with odd numbers.
 

Answers and Replies

  • #2
lavinia
Science Advisor
Gold Member
3,241
625
I'm trying to investigate this statement: The sum of n consecutive numbers is always divisible by n.

I've found already that it's only true when the total amount of numbers is an odd number. I've also found that the median and mean are the same with consecutive numbers. I can not prove that the it's only true with odd numbers.
try writing down a general formula for the sum
 
  • #3
mathman
Science Advisor
7,924
467
The remainders, after dividing by n, for n consecutive numbers are 0,1,...,n-1. Sum the remainders to get n(n-1)/2.

If n is odd, n-1 is even and (n-1)/2 is an integer, so this sum is divisible by n.

If n is even, n-1 is odd. n(n-1)/2 = n(n-2)/2 + n/2. (n-2)/2 is an integer, so n/2 is the remainder after dividing the sum by n.
 
Last edited:
  • #4
HallsofIvy
Science Advisor
Homework Helper
41,833
963
Another way to look at it: to find the sum of numbers from k to k+ n- 1, find the sum from 1 to k+ n- 1, (k+ n- 1)(k+ n)/2, then subtract the sum from 1 to k, k(k- 1)/2. That is ((k^2+ 2kn+ n^2- k- n)- (k^2- k))/2= (2kn+ n^2- n)/2= n((2k- n- 1)/2) so is divisible by n.
 
  • #5
mathman
Science Advisor
7,924
467
Another way to look at it: to find the sum of numbers from k to k+ n- 1, find the sum from 1 to k+ n- 1, (k+ n- 1)(k+ n)/2, then subtract the sum from 1 to k, k(k- 1)/2. That is ((k^2+ 2kn+ n^2- k- n)- (k^2- k))/2= (2kn+ n^2- n)/2= n((2k- n- 1)/2) so is divisible by n.
You missed the point. In your derivation 2k-n-1 must be even, so n must be odd. When n is even the expression has a remainder of n/2.
 
  • #6
11
0
Thank you very much for your everyone. I really appreciate it.

Mathman, could I run a couple of problems past you if you have a moment?

Regards,
Matt.
 
  • #7
11
0
You missed the point. In your derivation 2k-n-1 must be even, so n must be odd. When n is even the expression has a remainder of n/2.
Thank you very much for your everyone. I really appreciate it.
Mathman, could I run a couple of problems past you if you have a moment?

Regards,
Matt.
 
  • #8
mathman
Science Advisor
7,924
467
Thank you very much for your everyone. I really appreciate it.
Mathman, could I run a couple of problems past you if you have a moment?

Regards,
Matt.
If you submit them via the forum I will look at them. I prefer not to answer privately.
 
  • #9
HallsofIvy
Science Advisor
Homework Helper
41,833
963
You missed the point. In your derivation 2k-n-1 must be even,
How do you get that?

so n must be odd. When n is even the expression has a remainder of n/2.
 
  • #10
mathman
Science Advisor
7,924
467
In your derivation you assumed n((2k- n- 1)/2) is an integer divisible by n. Therefore (2k-1-n)/2 must be an integer.

2k--n-1: 2k is even, if n is even, n+1 is odd. Even number minus odd number is odd.
 

Related Threads on Sum of n consecutive numbers is divisible by n

Replies
7
Views
7K
  • Last Post
Replies
6
Views
13K
Replies
7
Views
641
  • Last Post
Replies
7
Views
2K
Replies
7
Views
10K
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
1
Views
932
Replies
6
Views
1K
Replies
3
Views
2K
Top