- 1,118
- 1
I'm writing up my maths notes to the computer, while looking over maths notes for series I spotted another way of proving the sum of natural numbers to n (to what I've been taught).
By definition:
\sum_{k=1}^n k = n + (n-1) + (n-2) + \ldots + (n - [n-2]) + (n - [n-1])
Separating terms we get:
\sum_{k=1}^n k = (n + n + \ldots + n) - [1 + 2 + 3 + \ldots + (n-2) + (n-1)]
\sum_{k=1}^n k = n^2 - \sum_{k=1}^{n-1} k
\sum_{k=1}^n k = n^2 - \left( \left[ \sum_{k=1}^{n} k \right] - n \right)
2\sum_{k=1}^n k = n^2 + n
\sum_{k=1}^n k = \frac{n(n+1)}{2}
So is this sufficient proof please?
Furthermore I was trying to prove from first principles that:
\frac{d}{dx} \left( x^n \right) = nx^{n-1}
For all real values of n, but so far I've only been able to prove it for all positive integers using binomial theorem. Could someone give me a clue at least please?
By definition:
\sum_{k=1}^n k = n + (n-1) + (n-2) + \ldots + (n - [n-2]) + (n - [n-1])
Separating terms we get:
\sum_{k=1}^n k = (n + n + \ldots + n) - [1 + 2 + 3 + \ldots + (n-2) + (n-1)]
\sum_{k=1}^n k = n^2 - \sum_{k=1}^{n-1} k
\sum_{k=1}^n k = n^2 - \left( \left[ \sum_{k=1}^{n} k \right] - n \right)
2\sum_{k=1}^n k = n^2 + n
\sum_{k=1}^n k = \frac{n(n+1)}{2}
So is this sufficient proof please?
Furthermore I was trying to prove from first principles that:
\frac{d}{dx} \left( x^n \right) = nx^{n-1}
For all real values of n, but so far I've only been able to prove it for all positive integers using binomial theorem. Could someone give me a clue at least please?
Last edited: