ds-t2a-a

Or alternatively x y x ε s y ε s xy ε 4 10 pts let

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

View Full Document Right Arrow Icon
or alternatively ( x)( y)( (x ε S y ε S) x+y ε 4. (10 pts.) Let {a n } be defined by the formula a n =5 n+2f o r n = 1,2,3,. ... Define the sequence {b n } recursively by b 1 = 7 and b n+1 =b n + 5 for n = 1,2,3,. ... Give a proof by induction that a n n for n = 1,2,3,. ... Proof: Basis Step: Evidently, a 1 ( 1 )+2=7=b 1 . Induction Step: To show ( n ε + )( a n n a n+1 n+1 ), assume a n n for an arbitrary n ε + . Then using the induction hypothesis, a n n a n +5=b n + 5 [Algebra; Motivation: Use the recursive definition of {b n }.] ( 5 n+2 )+5=b n+1 [Recursive definition of {b n }, definition of {a n }] 5(n+1)+2=b n+1 [Algebra; Motivation: Use the definition of {a n }] a n+1 n+1 [The definition of {a n }] Since we have shown that a n n implies a n+1 n+1 for an arbitrary n ε + , universal generalization implies the truth of ( n ε + )( a n n a n+1 n+1 ). Finally, since we have verified the hypotheses of the Principle of Mathematical induction, using modus ponens, we may conclude that the proposition ( n ε + )( a n n ) is true.
Background image of page 1

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

View Full Document Right Arrow Icon
Brief Answers TEST-2A/MAD2104 Page 2 of 2 5. (15 pts.) Label each of the following assertions with "true" or "false". Be sure to write out the entire word.
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 2

or alternatively x y x ε S y ε S xy ε 4 10 pts Let a n...

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