Sums
Task number: 2795
Prove by mathematical induction:
Variant 1
\( \displaystyle \sum_{i=1}^n i = \frac{n(n+1)}{2}. \)
Variant 2
\( \displaystyle \sum_{i=1}^n (2i-1) = n^2. \)
Variant 3
\( \displaystyle \sum_{i=1}^n i^2 = \frac{n(n+1)(2n+1)}6. \)
Variant 4
\( \displaystyle \sum_{i=1}^n i^3 = \left(\frac{n(n+1)}2\right)^2. \)