
John M. answered 05/03/16
Tutor
5.0
(87)
Certified Math Teacher with Statistics Masters
Induction proofs require two steps. First, you must show that the proof is true at lest once. Then you show that if it is true for n = k, it is also true for n = k+1.
Let's start with the first step. We need to show that x7=x1.
x7= x6 - x5 = (x5 - x4) - x5 = -x4 = -(x3 - x2) = -[(x2 - x1) - x2] = -(-x1) = x1
(Note: It's a little tedious, but keep working to apply the original sequence definition until you reach your goal.)
Now, move onto the second part. Assume xk+6=xk is true for some k ∈ N.
We must prove the statement true for n = k+1. (note: (k+1)+6 = k+7)
xk+7 = xk+6 - xk+5 = xk - xk-1 = xk+1
This completes the proof by induction.