A New Proof Of 1+2+3+...+n = n(n+1)/2n(n+1)/2

Let f(n)=1+2+3+...+nf(n)=1+2+3+...+n.

Now, we have f(n)f(n1)=nf(n)-f(n-1)=n, and we will prove f(n)+f(n1)=n2f(n)+f(n-1)=n^2 by induction.

Since the proposition is true for n=1n=1, let us assume it is true for n=kn=k. Now for n=k+1n=k+1, we have: f(k)+f(k+1)=[f(k)+f(k1)]+2k+1=k2+2k+1=(k+1)2f(k)+f(k+1)=[f(k)+f(k-1)]+2k+1=k^2+2k+1=(k+1)^2. So, we conclude that f(n)+f(n1)=n2f(n)+f(n-1)=n^2 for n belongs to N. Now, we have a system of simultaneous equations: f(n)+f(n1)=n2f(n)+f(n-1)=n^2 f(n)f(n1)=nf(n)-f(n-1)=n solving them, we have 2f(n)=n2+n2f(n)=n^2+n which yields: f(n)=n(n+1)/2f(n)= \boxed {n(n+1)/2}

#Algebra

Note by Mohammed Imran
1 year, 3 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

I guess you meant f(n)-f(n-1)=n (not 2) at two instances.

K T - 1 year, 3 months ago

Log in to reply

thank you very much!!!

Mohammed Imran - 1 year, 3 months ago

Cool

A Former Brilliant Member - 1 year, 2 months ago

Log in to reply

thank you very much

Mohammed Imran - 1 year, 2 months ago

How is this proof?

Mohammed Imran - 1 year, 2 months ago

Well I guess that you used the mathematical induction in this problem, right? It's a kind of simple method to prove such these kind of mathematical statements. I like it.

Anh Khoa Nguyễn Ngọc - 1 year, 2 months ago

Log in to reply

Thx!!!

Mohammed Imran - 1 year, 2 months ago

Cool proof! @Mohammed Imran

A Former Brilliant Member - 1 year, 1 month ago

Log in to reply

thank you!

Mohammed Imran - 7 months, 2 weeks ago

Oh nice, where did you see this?

Nitin Kumar - 1 year, 3 months ago

Log in to reply

this is the original proof of the theorem by gauss

Mohammed Imran - 1 year, 3 months ago

Log in to reply

Then why did you type it as yours?🤔

Nitin Kumar - 1 year, 3 months ago

Log in to reply

@Nitin Kumar I said chew seong's proof is not original

Mohammed Imran - 1 year, 3 months ago

Log in to reply

@Mohammed Imran Ok

Nitin Kumar - 1 year, 3 months ago

@Brilliant Mathematics, @joan davis has wrote 5 posts that don't relate to mathematics.

Log in to reply

Thank you for notifying us again. We will take action on this shortly.

Brilliant Mathematics Staff - 1 year ago
×

Problem Loading...

Note Loading...

Set Loading...