This preview shows page 1. Sign up to view the full content.
Unformatted text preview: M325K Sample Test 1
No Calculators, books, notes, etc.
1. Define what it means for an integer to be "prime". 2. Prove or disprove: If n is odd, then (n2 - 1)/2 is even. 3. Negate the statement "Every even integer greater than 2 is the sum of 2 primes," by first writing it in formal symbols. 4. Use a truth table to tell whether the argument form is valid: p q r rq qp r 5. Use valid argument forms to deduce t from the premises: p r s ts u p w uw 6. Let I(x) be the statement "x has an internet connection", and C(x, y) be the statement "x has chatted with y". Use quantifiers to express the statement "Someone in this class has an internet connection but has not chatted with anyone else in the class". 7. Let L(x, y) be the statement "x loves y", with. Translate into a good English sentence: x(yL(y, x) z((wL(w, z)) z = x)) 8. State the converse, inverse and contrapositive of "You will be rich only if you work hard." 9. Give an example of an argument which uses the Modus Tollens form. ...
View Full 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 at Austin.
- Spring '08