to show my superiority and ur stupidity ill solve it using MI u
dumb f*ckhead u better be grateful
For any positive integer n, 1 + 2 + ... + n = n(n+1)/2.
Proof by MI: Let's let P(n) be the statement 1 + 2 + ... + n = (n
(n+1)/2
The idea is that P(n) should be an assertion that for any n is
verifiably either true or false
Verify that P(1) is True. P(1) asserts 1 = 1(2)/2 which true
Prove the following assertion --- If there is a k such that P(k) is
true, then (for this same k) P(k+1) is true Thus, there is a k such
that 1 + 2 + ... + k = k (k+1)/
Prove, for this same k, the formula 1 + 2 + ... + k + (k+1) =
(k+1)(k+2)/2
1 + 2 + ... + k + (k+1) = k(k+1)/2 + (k+1) = (k(k+1) + 2 (k+1))/2 =
(k+1)(k+2)/2. The first equality is a consequence of the inductive
assumption.
now bow down before me u stupid piece of f*ck
