maths.freeDiscrete Math & Logic › Sums and induction

Sums and induction

Closed forms for sums, and how induction proves them.

Σ k = n(n+1)/2 is the formula Gauss found at school; Σ k² and Σ k³ have closed forms too. Induction proves them: check n = 1, then show that if the formula holds for n it holds for n + 1.

ឧទាហរណ៍​ដែល​បាន​ធ្វើ: sum of k for k = 1 to n

Sum k for k = 1 to n

\sum_{k=1}^{n} k

ជំហាន​ដោយ​ជំហាន

  1. \sum_{k=1}^{n} k

    Write the sum out.

  2. 1 + 2 + 3 + 4 + \cdots

    The first few terms.

  3. = \frac{n \left(n + 1\right)}{2}

    Closed form (a standard summation formula, provable by induction).

បង្ហាញ​ចម្លើយ
\frac{n \left(n + 1\right)}{2}

ព្យាយាម​របស់​អ្នក​ផ្ទាល់

បន្ថែម​ទៀត​ក្នុង Discrete Math & Logic