Printed by Mathpad TRIAL EDITION

(a) (b) (c)

F 2n + 1 = 3F 2n 1 F 2n 3 F n + F n 1 = F 2n 1 F n + 1 F n + F n F n 1 = F 2n
2 2

Proof: F 2n + 1 = 3F 2n 1 F 2n 3 (a) Base: For n = 2, the LHS = F 5 = 5 RHS = 3F 3 F1 = 3(2) 1 = 5 Thus, since LHS = RHS, (a) is true for n = 2. Induction: Let k 2 be given. Suppose (*) is true for n = k. This means F 2k +1 = 3F 2k 1 F 2k 3 Next, let n = k + 1. This means LHS = F 2k + 3 = F 2k + 2 + F 2k +1 = F 2k + 2 + 3F 2k 1 F 2k 3 = F 2k + 2 + 3F 2k 1 + F 2k 2 F 2k 1 = F 2k + 2 + 2F 2k 1 + F 2k 2 = F 2k +1 + F 2k + 2F 2k 1 + F 2k 2 = F 2k + F 2k 1 + F 2k + 2F 2k 1 + F 2k 2 = 2F 2k + 2F 2k 1 + F 2k = 3F 2k + 2F 2k 1 Thus, since LHS = RHS, (a) is true for n = k + 1. Therefore (a) is true for all n 2.// RHS = 3F 2k +1 F 2k 1 = 3F 2k + 3F 2k 1 F 2k 1 = 3F 2k + 2F 2k 1

Proof: F n + 1 F n + F n F n 1 = F 2n (c) using (b) Base: For n = 1, LHS = F 2 F1 + F1 F 0 = (1)(1) + (1)(0) = 1 RHS = F 2 = 1 Thus, since LHS = RHS, (c) is true for n = 1; Induction: Let k 1 be given. Suppose (c) is true for n = k. That means F k +1 F k + F k F k 1 = F 2k

Printed by Mathpad TRIAL EDITION

Next, we let n = k + 1. That means LHS = F k + 2 F k +1 + F k +1 F k = (F k +1 + F k )(F k + F k +1 ) + F k +1 F k = F k +1 F k + F k +1 F k 1 + F k + F k F k 1 + F k +1 F k = F k +1 F k + F k +1 F k 1 + F k + F 2k = F k 1 (F k + F k 1 ) + F k + F k +1 F k + F 2k = F k F k 1 + F k 1 + F k + F k +1 F k + F 2k = F 2k 1 + F 2k + F 2k = F 2k +1 + F 2k = F 2k + 2

2 2 2 2 2

RHS = F 2k + 2

Thus, since LHS = RHS, (c) is true for n = k + 1. Therefore, (c) is true for all n 1.//