answersLogoWhite

0

Assuming you mean the first n counting numbers then:

let S{n} be the sum; then:

S{n} = 1 + 2 + ... + (n-1) + n

As addition is commutative, the sum can be reversed to give:

S{n} = n + (n-1) + ... + 2 + 1

Now add the two versions together (term by term), giving:

S{n} + S{n} = (1 + n) + (2 + (n-1)) + ... + ((n-1) + 2) + (n + 1)

→ 2S{n} = (n+1) + (n+1) + ... + (n+1) + (n+1)

As there were originally n terms, this is (n+1) added n times, giving:

2S{n} = n(n+1)

→ S{n} = ½n(n+1)

The sum of the first n counting numbers is ½n(n+1).

User Avatar

Wiki User

8y ago

Still curious? Ask our experts.

Chat with our AI personalities

ReneRene
Change my mind. I dare you.
Chat with Rene
BeauBeau
You're doing better than you think!
Chat with Beau
JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan
More answers

The sum of the first n counting numbers is n*(n+1)/2

User Avatar

Wiki User

8y ago
User Avatar

Add your answer:

Earn +20 pts
Q: What is the sum of the first n numbers?
Write your answer...
Submit
Still have questions?
magnify glass
imp