1. Show that the difference between the squares of two consecutive integers is always an odd integer. 2. Check whether the following argument is valid or not. Justify your answer – “Kumar is studying Mathematics course. If Kumar is studying the Mathematics course, then he is not practicing his flute. If Kumar is not practicing his flute, then his father will not buy a new flute. Therefore, Kumar’s father will not buy a new flute.” 3. Check whether {¬[𝑝 ∧ (¬𝑞 ∧ 𝑟)] ∨ (𝑞 ∧ 𝑟) ∨ (𝑝 ∧ 𝑟)} ⇔ 𝑟. 4. Check whether [𝑝 → (𝑞 → 𝑟)] → [(𝑝 → 𝑞) → (𝑝 → 𝑟)] is a tautology. 5. Write the negation, inverse, converse and contrapositive of the statement “If 5𝑥 + 1 = 11, then 𝑥 = 2.” 6. Write the negation, inverse, converse and contrapositive of the statement “A figure is a quadrilateral whenever it is a square.” 7. “All monkeys will speak French.” Give a logical expression for this statement when the domain is the set of all (i) monkeys (ii) animals. 8. Check whether [(𝑝 → 𝑞) ∧ (¬𝑟 ∨ 𝑠) ∧ (𝑝 ∨ 𝑟)] → (¬𝑞 → 𝑠) is a tautology using truth table. 9. Using rules of inference and the following premises find out whether it rained or not. “If it does not rain or the sky is clear, then the sailing race will be held. If the sailing race is held, then the life saving demonstration will go on or Randy will participate in the race. The trophy will be awarded when Randy participates in the race. Neither the life saving demonstration went on nor the trophy was awarded.” 10. Show that for any integer 𝑛, 𝑛2 is even or odd according as 𝑛 is even or odd. Using this can you say anything about the sum 𝑛 + 𝑛2 ? Explain. 11. Write the negation, inverse, converse and contrapositive of the statement: “It is sufficient to find the converse of a proposition to get its inverse.” 12. Give a direct proof for the proposition: “The square of a prime number is composite.” 13. Check the validity of the following argument: 𝑝 → 𝑞, 𝑟 ∨ 𝑠, 𝑟 → 𝑡, ~𝑞, 𝑠 → 𝑝, ∴ 𝑡. 14. Show that [(𝑝 ∨ 𝑞) → 𝑟] ≡ [~𝑟 → (~𝑝 ∧ ~𝑞)], using (i) truth table (ii) laws of logic. 15. Write the negation, inverse, converse and contrapositive of the statement “Whenever you get a speeding ticket, you are driving over 65 miles per hour.” 16. Express the statement “No student in the class likes ice – cream”, using quantifiers. Negate the statement in simple English. 17. Find the truth values of the statements ∀𝑥 𝑝(𝑥), ∃𝑥 ¬𝑝(𝑥) for 𝑝(𝑥): 𝑥 + 3 = 2𝑥, 𝑥 ∈ ℝ. Justify your answer. 18. If the domain of the propositional function 𝑝(𝑥) is {−5, −3, −1,1,3,5}, then express the following statements using only negations, conjunctions and disjunctions (𝑖) ∃𝑥 ¬𝑝(𝑥) (𝑖𝑖) ∀𝑥 𝑝(𝑥) (𝑖𝑖𝑖) ¬[∃𝑥 𝑝(𝑥)] (𝑖𝑣) ¬[∀𝑥 ¬𝑝(𝑥)] .
Page 1 of 3 19. Show that ~[~𝑝 → (~𝑝 ∧ 𝑞)] ⇔ ~𝑝 ∧ ~𝑞, by developing a series of logical equivalences with the specification of corresponding laws. 20. Negate and simplify the following: (𝑖) ∃𝑥 [𝑝(𝑥) ∨ ~𝑞(𝑥)] (𝑖𝑖) ∀𝑥 [~𝑝(𝑥) ∨ ~𝑞(𝑥)] (𝑖𝑖𝑖) ∀𝑥 [~𝑝(𝑥) ∧ 𝑞(𝑥)] (𝑖𝑣) ∃𝑥 [𝑝(𝑥) ∧ 𝑞(𝑥)]. 21. Write the negation, inverse, converse and contrapositive of the statement “An automated e – mail reply can be sent if you are travelling.” 22. Find the truth values of the following statements if the universe of discourse consists of all integers. (𝑖) ∀𝑛 (𝑛 + 1 > 𝑛) (𝑖𝑖) ∀𝑛 (𝑛2 > 𝑛). 23. Show that [(𝑝 ∨ 𝑞) ∧ (¬𝑝 ∨ 𝑟)] → (𝑞 ∨ 𝑟) is a tautology. 24. Show that if 𝑛 is an integer and 𝑛3 + 5 is odd, then 𝑛 is even by (i) contrapositive method (ii) contradiction method. 25. Show that (𝑝 → 𝑞) → 𝑟 ≢ 𝑝 → (𝑞 → 𝑟) using truth table. 26. “If 𝑚 is an even integer, then 𝑚 + 7 is odd.” Prove this statement by (i) Direct method (ii) Method of contradiction (iii) Method of contrapositive. 27. Show that (𝑝 ∨ 𝑞 ∨ 𝑟) ∧ (𝑝 ∨ 𝑡 ∨ ~𝑞) ∧ (𝑝 ∨ ~𝑡 ∨ 𝑟) ≡ 𝑝 ∨ [𝑟 ∧ (𝑡 ∨ ~𝑞)], using laws of logic. 28. Check whether (𝑝 → 𝑞) → (𝑟 → 𝑠) ⇔ (𝑝 → 𝑟) → (𝑞 → 𝑠) using truth table. 29. Express each of the following statements using quantifiers. Then form the negation of the statements so that no negation is to the left of a quantifier. Express the negation in simple English. D not simply use the phrase “It is not the case that”. (i) All dogs have fleas. (ii) There is a horse that can add. (ii) Every koala can climb. (iv) No monkey can speak French. (v) There exists a pig that can swim and catch fish. (vi) No one can keep secret. (vii) Some people do not follow the rules. 30. Using rules of inference, test the validity of the following argument: “If my check book is on my office table, then I paid my phone bill. I was looking at the phone bill for payment at breakfast or I was looking at the phone bill for payment in my office. If I was looking at the phone bill at breakfast, then the check book is on the break fast table. I didn’t pay my phone bill. If I was looking at the phone bill in my office, then the check book is on my office table. Therefore, the check book was on the breakfast table.” 31. Give a proof by contradiction to prove that “If 𝑛 is a perfect square, then 𝑛 + 2 is not.” 32. Check whether [𝑝 → (𝑞 ∨ 𝑟)] ≡ ~𝑟 → (𝑝 → 𝑞). 33. Write the negation, inverse, converse and contrapositive of the statement “The converse is not true only if the inverse is true.” 34. Show that [𝑟 → (𝑝 ∨ 𝑞)] ≡ [(~𝑝 ∧ ~𝑞) → ~𝑟], using (i) truth table (ii) laws of logic. 35. Show that 𝑛2 − 1 is a multiple 4, if 𝑛 is an odd integer. 36. A murder happened in Willey’s cottage. Solve the murder mystery from the following data, using rules of inference. “If the cottage is next to a forest, then the thief is the murderer. If the thief is the murderer, then
Page 2 of 3 the lights in the garden will be damaged and the window glasses will be broken. If the lights in the garden were damaged and the dogs were asleep, then the house maid is the murderer. The cottage is next to a forest and the dogs were asleep.” 37. Show that [¬𝑝 ∧ (𝑝 ∨ 𝑞)] → 𝑞 is a tautology. 38. Show that the following is a valid argument: “Every one shouts or cries. Not everyone cries. So some people shout and don’t cry.” 39. Give a proof by contradiction to prove that “The sum of a rational number and an irrational number is an irrational number.” 40. For each of the following arguments, explain which rules of inference are used for each step. “Doug, a student in this class, knows how to write programs in JAVA. Everyone who knows how to write programs in JAVA can get a high paying job. Therefore, someone in this class can get a high paying job.” 41. Prove that if an integer 𝑛 is such that 𝑛 − 2 is divisible by 3, then 𝑛2 − 1 is divisible by 3. 42. Write a logical expression for the statement “He is neither tall nor handsome.” 43. Write the negation, inverse, converse and contrapositive of the statement “Practicing her serve daily is a sufficient condition for Martina to have a good chance of winning the tennis tournament.” 44. Express the negations of the following statements using quantifiers and in simple English. (i) For all real numbers 𝑥 if 𝑥 > 3, then 𝑥 2 > 9. (ii) Not all birds can fly. 45. Write the negation, inverse, converse and contrapositive of the statement “To get tenure as a professor, it is sufficient to be world famous.” 46. Determine the truth value of the following statements if the universe of discourse is the set of all real numbers. (𝑖) ∃𝑥 𝑥 2 = −2 (𝑖𝑖) ∀𝑥 (𝑥 2 + 2 ≥ 1). 47. Write the negation, inverse, converse and contrapositive of the statement “Divisibility by 21, is a sufficient condition for divisibility by 7.” 48. Determine the truth value of the following statements if the universe of discourse is the set of all real numbers. (𝑖) ∀𝑥 (𝑥 2 ≥ 𝑥) (𝑖𝑖) ∀𝑥 (|𝑥| > 0). 49. Prove that 𝑝 → (𝑞 → 𝑟), (𝑝 ∨ ¬𝑠), 𝑞 ∴, 𝑠 → 𝑟 is valid using (i) Direct method (ii) Indirect method. 50. Using rules of inference check the validity of the following argument form: ∀𝑥 [𝑃(𝑥) ∨ 𝑄(𝑥)], ∀𝑥 [¬𝑄(𝑥) ∨ 𝑆(𝑥)], ∃𝑥 ¬𝑃(𝑥), ∀𝑥 [𝑅(𝑥) → ¬𝑆(𝑥)] ∴, ∃𝑥 ¬𝑅(𝑥).
