m325pracfin - M325K Practice Mega-Final 1. Make a truth...

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

View Full Document Right Arrow Icon
M325K Practice Mega-Final 1. Make a truth table for the statement q ( p q ) . 2. Write the negation of “My computer is broken or I’m doing something wrong.” 3. Write the contrapositive of “If I’m doing things correctly, then my computer is not broken.” 4. Exercise 41 on page 63. 5. Let A be a finite set. Use the strong form of mathematical induction to prove that |P ( A ) | = 2 | A | . 6. Translate the following statement into logical symbols and use your expression to write a good English negation of it. “Every student in this class has an ancestor from Texas.” 7. Prove or disprove: If n is odd, then n 2 is odd. 8. Prove by contradiction: If 3 n + 2 is odd, then n is odd. 9. Prove or disprove: For every prime number n , n + 2 is prime. 10. Prove or disprove that for all positive integers n , 1 · 1!+2 · 2!+3 · 3!+ ··· + n · n ! = ( n +1)! - 1 . 11. Prove the generalization of DeMorgan’s Law: For sets
Background image of page 1

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

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

This note was uploaded on 05/02/2011 for the course M 325k taught by Professor Schurle during the Spring '08 term at University of Texas.

Page1 / 2

m325pracfin - M325K Practice Mega-Final 1. Make a truth...

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