To make this proof, we will use the principle of mathematical induction.
PRINCIPLE OF MATHEMATICAL INDUCTION: “To prove that P(n) is true for all positive integers n, where P (n) is a propositional function, we complete two steps: BASIS STEP: We verify that P (1) is true. INDUCTIVE STEP: We show that the conditional statement P (k) → P (k + 1) is true for all positive integers k.” Source: Discrete Mathematics and its Applications by Rosen.
Basis step:
P(0): 2 = (1- (-7)0+1)/4
(1- (-7)0+1)/4 = (1 – (-7)/4 = 8/4 = 2.
Notice that in this case, the basis step is P(0) and P(1) because the formula is valid for all non-negative integers, and 0 is a nonnegative integer.
Inductive hypothesis:
P(k): 2−2·7+2·72 −···+2(−7)k =(1− (−7)k+1)/4
Inductive step:
P(k+1): 2−2·7+2·72 −···+2(−7)k + 2(-7)k+1 =(1− (−7)k+2)/4
2−2·7+2·72 −···+2(−7)k + 2(-7)k+1 Substituting P(k) we get,
=(1− (−7)k+1)/4+ 2(-7)k+1
=[1− (−7)k+1+ 8(-7)k+1]/4 if you don’t get this steep, think that 1/4 +3 = (1+3×4)/4
=[1+ 7(-7)k+1]/4 (-1a +8a=7a)
=[1 – (-7)(-7)k+1]/4, using the fact that axan=an+1 we get,
= (1- (-7)k+2)/4
⧠
Related exercises:
- Prove that ∑(-1/2)^j = [2^(n+1) + (-1)^n]/3×2^n whenever n is a nonnegative integer
- a) Find a formula for 1/(1×2) + 1/(2×3) + 1/n(n+1) by examining the values of this expression for small values of n. b)Prove the formula you conjectured in part (a)
- Let P(n) be the statement that 1^3 +2^3 +···+n^3 = (n(n + 1)/2)^2 for the positive integer n