Math_300A_Quiz_1-ANSWERS

Qed question 2 prove by induction for all integers n 1

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: ( n − 1) + 3 ȹ n ( n + 1)( n + 2) ( n − 1) n ( n + 1) + n ( n + 1) = n ( n + 1)ȹ ȹ = € ȹ Ⱥ 3 3 3 and this equals the right hand side of the equation to be proved. QED Question 2: Prove by induction: € For all integers n ≥1, the integer 5n – 1 is divisible by 4. PROOF: Proof by induction. The statement above is true when n= 1: For 51 – 1 = 4, which is divisible by 4. Assume True: 5n – 1 is divisible by 4. This means that 5n – 1 = 4a for an integer a. Then Prove: 5n...
View Full Document

Ask a homework question - tutors are online