Proof of the formula for the sum of the first n natural numbers
- Get link
- X
- Other Apps
Hello everyone. Today we will prove the formula for the sum of the first \(n \) natural numbers. We will use the method of mathematical induction as a proof method. It is believed that the Pythagoreans also knew this formula.
Theorem: For any natural number \(n \) the following formula holds: \[\displaystyle \sum_{k = 1} ^ nk = \frac {n (n + 1)} {2} \] Proof:
1. Base case (n = 1) \[\displaystyle \sum_{k = 1} ^ {1} k = \frac {1 \cdot (1 + 1)} {2} \] \[1 = \frac {1 \cdot (2)} {2} \] \[1 = \frac {2} {2} \] \[1 = 1 \]
2. Induction hypothesis (n = m)
Suppose that: \[\displaystyle \sum_{ k = 1} ^ mk = \frac {m (m + 1)} {2} \]
3. Inductive step (n = m + 1)
Using the assumption from the second step, we will prove that: \[\displaystyle \sum_{k = 1} ^ {m + 1} k = \frac {(m + 1) (m + 2)} {2} \] So, \[\displaystyle \sum_{k = 1} ^ {m + 1} k = \displaystyle \sum_{k = 1} ^ {m} k + m + 1 = \] \[\frac {m (m +1)} {2} + m + 1 = \] \[\frac {m ^ 2 + m + 2m + 2} {2} = \] \[\frac {m ^ 2 + 2m + m + 2} {2} = \] \[\frac {m (m + 2) + (m + 2)} {2} = \] \[\frac {(m + 1) (m + 2)} {2} \]
\(\blacksquare \)
- Get link
- X
- Other Apps
Comments
Post a Comment