This document provides instructions for a Discrete Mathematics assignment that is due on October 19th, 2022 at 8:00 am. The assignment contains 5 questions covering topics like truth tables, direct proofs, sets, quantifiers, and logical equivalence. Students must construct a truth table, prove a statement is a tautology, use a direct proof to show the sum of an even and odd integer is odd, define and give examples of sets, differentiate quantifiers, use a counterexample proof, and define logical equivalence.
This document provides instructions for a Discrete Mathematics assignment that is due on October 19th, 2022 at 8:00 am. The assignment contains 5 questions covering topics like truth tables, direct proofs, sets, quantifiers, and logical equivalence. Students must construct a truth table, prove a statement is a tautology, use a direct proof to show the sum of an even and odd integer is odd, define and give examples of sets, differentiate quantifiers, use a counterexample proof, and define logical equivalence.
This document provides instructions for a Discrete Mathematics assignment that is due on October 19th, 2022 at 8:00 am. The assignment contains 5 questions covering topics like truth tables, direct proofs, sets, quantifiers, and logical equivalence. Students must construct a truth table, prove a statement is a tautology, use a direct proof to show the sum of an even and odd integer is odd, define and give examples of sets, differentiate quantifiers, use a counterexample proof, and define logical equivalence.
1. Construct a truth table for the formula P ^ ( P → Q ) (3 marks)
2. Show that ( P → Q ) ( Q → P ) is a tautology. (4 marks) 3. Use Direct proof to show that “Sum of an even integer and an odd integer is odd” (4 marks) 4. a) What is a set? (1 mk) b) With examples indicate how we can represent sets (4 mks) c) Differentiate between finite and infinite sets (2 mks) d) Define cardinality and hence what is the cardinality of N (2 mks) e) What is a complement of a set, give an example (1 mk) 5.a) State and differentiate the two types of quantifiers (4mks) b) Using counterexample proof this statement “If n is an integer and n2 is divisible by 4, then n is divisible by 4.” (3 mks) c) What is logical equivalence? (2 mks)