sol7 - CSE 21 Solutions Problem Set 7 1 Proof Initial step...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSE 21: Solutions - Problem Set 7 1. Proof. Initial step: For n = 1, the left-hand size is 1 3 = 1 and the right-hand side is ( 1+1 2 ) 2 = 1. Then the equality holds. Inductive Hypothesis: Suppose it is true for n = t , i.e., 1 3 + 2 3 + ··· + t 3 = t + 1 2 2 . We prove that it’s true for n = t + 1, i.e., 1 3 + 2 3 + ··· + t 3 + ( t + 1) 3 = t + 2 2 2 . Inductive step: 1 3 + 2 3 + ··· + t 3 + ( t + 1) 3 = ( 1 3 + 2 3 + ··· + t 3 ) + ( t + 1) 3 = t + 1 2 2 + ( t + 1) 3 Inductive hypothesis = ( t + 1) t 2 2 + ( t + 1) 3 = ( t + 1) 2 4 ( t 2 + 4( t + 1) ) = ( t + 1) 2 4 ( t + 2) 2 = ( t + 2)( t + 1) 2 2 = t + 2 2 2 2. Initial step: For n = 1, the left-hand size is 1 2- 1 2 · 0 = 1, and the right-hand side is (- 1) 2 = 1. So the equality holds. Inductive hypothesis: Suppose it’s true for n = k , i.e., F 2 k- F k +1 F k- 1 = (- 1) k +1 . We prove that it’s true for n = k + 1, i.e., F 2 k +1- F k +2 F k = (- 1) k +2 ....
View Full Document

Page1 / 5

sol7 - CSE 21 Solutions Problem Set 7 1 Proof Initial step...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online