Discrete Mathematicsmcq'S: Types of Proofs and Types of Set
This document discusses different types of proofs in mathematics including:
- Direct proof, contrapositive proof, proof by contradiction, and others.
- It provides examples of statements and identifies the appropriate type of proof to use.
- It also covers types of sets such as finite, infinite, empty sets, and converting between roster and set-builder forms.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
110 views39 pages
Discrete Mathematicsmcq'S: Types of Proofs and Types of Set
This document discusses different types of proofs in mathematics including:
- Direct proof, contrapositive proof, proof by contradiction, and others.
- It provides examples of statements and identifies the appropriate type of proof to use.
- It also covers types of sets such as finite, infinite, empty sets, and converting between roster and set-builder forms.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 39
Discrete
(Types of Proofs and Types of
MathematicsMCQ’s Set) By Muhammad Sohaib Yousaf Types of Proofs • Let the statement be “If n is not an odd integer then square of n is not odd.”, then if P(n) is “n is an not an odd integer” and Q(n) is “(square of n) is not odd.” For direct proof we should prove _________ a) ∀nP ((n) → Q(n)) b) ∃nP ((n) → Q(n)) c) ∀n~(P ((n)) → Q(n)) d) ∀nP ((n) → ~(Q(n))) Types of Proofs • Let the statement be “If n is not an odd integer then square of n is not odd.”, then if P(n) is “n is an not an odd integer” and Q(n) is “(square of n) is not odd.” For direct proof we should prove _________ a) ∀nP ((n) → Q(n)) b) ∃nP ((n) → Q(n)) c) ∀n~(P ((n)) → Q(n)) d) ∀nP ((n) → ~(Q(n))) View Answer • Answer: a Explanation: Definition of direct proof Types of Proofs • Which of the following can only be used in disproving the statements? a) Direct proof b) Contrapositive proofs c) Counter Example d) Mathematical Induction Types of Proofs • Which of the following can only be used in disproving the statements? a) Direct proof b) Contrapositive proofs c) Counter Example d) Mathematical Induction View Answer • Answer: c Explanation: Counter examples cannot be used to prove results Types of Proofs • Let the statement be “If n is not an odd integer then sum of n with some not odd number will not be odd.”, then if P(n) is “n is an not an odd integer” and Q(n) is “sum of n with some not odd number will not be odd.” A proof by contraposition will be ________ a) ∀nP ((n) → Q(n)) b) ∃nP ((n) → Q(n)) c) ∀n~(P ((n)) → Q(n)) d) ∀n(~Q ((n)) → ~(P(n))) Types of Proofs • Let the statement be “If n is not an odd integer then sum of n with some not odd number will not be odd.”, then if P(n) is “n is an not an odd integer” and Q(n) is “sum of n with some not odd number will not be odd.” A proof by contraposition will be ________ a) ∀nP ((n) → Q(n)) b) ∃nP ((n) → Q(n)) c) ∀n~(P ((n)) → Q(n)) d) ∀n(~Q ((n)) → ~(P(n))) View Answer • Answer: d Explanation: Definition of proof by contraposition Types of Proofs • When to proof P→Q true, we proof P false, that type of proof is known as ___________ a) Direct proof b) Contrapositive proofs c) Vacuous proof d) Mathematical Induction . Types of Proofs • When to proof P→Q true, we proof P false, that type of proof is known as ___________ a) Direct proof b) Contrapositive proofs c) Vacuous proof d) Mathematical Induction View Answer • Answer: c Explanation: Definition of vacuous proof. Types of Proofs • In proving √5 as irrational, we begin with assumption √5 is rational in which type of proof? a) Direct proof b) Proof by Contradiction c) Vacuous proof d) Mathematical Induction View Answer • Answer: b Explanation: Definition of proof by contradiction. Types of Proofs • In proving √5 as irrational, we begin with assumption √5 is rational in which type of proof? a) Direct proof b) Proof by Contradiction c) Vacuous proof d) Mathematical Induction Types of Proofs • A proof covering all the possible cases, such type of proofs are known as ___________ a) Direct proof b) Proof by Contradiction c) Vacuous proof d) Exhaustive proof Types of Proofs • A proof covering all the possible cases, such type of proofs are known as ___________ a) Direct proof b) Proof by Contradiction c) Vacuous proof d) Exhaustive proof View Answer • Answer: d Explanation: Definition of exhaustive proof. Types of Proofs • Which of the arguments is not valid in proving sum of two odd number is not odd. a) 3 + 3 = 6, hence true for all b) 2n +1 + 2m +1 = 2(n+m+1) hence true for all c) All of the mentioned d) None of the mentioned Types of Proofs • Which of the arguments is not valid in proving sum of two odd number is not odd. a) 3 + 3 = 6, hence true for all b) 2n +1 + 2m +1 = 2(n+m+1) hence true for all c) All of the mentioned d) None of the mentioned View Answer • Answer: a Explanation: Some examples are not valid in proving results Types of Proofs • A proof broken into distinct cases, where these cases cover all prospects, such proofs are known as ___________ a) Direct proof b) Contrapositive proofs c) Vacuous proof d) Proof by cases Types of Proofs • A proof broken into distinct cases, where these cases cover all prospects, such proofs are known as ___________ a) Direct proof b) Contrapositive proofs c) Vacuous proof d) Proof by cases View Answer • Answer: c Explanation: Definition of proof by cases. Types of Proofs • A proof that p → q is true based on the fact that q is true, such proofs are known as ___________ a) Direct proof b) Contrapositive proofs c) Trivial proof d) Proof by cases Types of Proofs • A proof that p → q is true based on the fact that q is true, such proofs are known as ___________ a) Direct proof b) Contrapositive proofs c) Trivial proof d) Proof by cases View Answer • Answer: c Explanation: Definition of trivial proof. Types of Proofs • A theorem used to prove other theorems is known as _______________ a) Lemma b) Corollary c) Conjecture d) None of the mentioned Types of Proofs • A theorem used to prove other theorems is known as _______________ a) Lemma b) Corollary c) Conjecture d) None of the mentioned View Answer • Answer: a Explanation: Definition of lemma Types of Set • {x: x is an integer neither positive nor negative} is ________ a) Empty set b) Non-empty set c) Finite set d) Non- empty and Finite set Types of Set • {x: x is an integer neither positive nor negative} is ________ a) Empty set b) Non-empty set c) Finite set d) Non- empty and Finite set View Answer • Answer: d Explanation: Set = {0} non-empty and finite set Types of Set • {x: x is a real number between 1 and 2} is an ________ a) Infinite set b) Finite set c) Empty set d) None of the mentioned Types of Set • {x: x is a real number between 1 and 2} is an ________ a) Infinite set b) Finite set c) Empty set d) None of the mentioned View Answer • Answer: a Explanation: It is an infinite set as there are infinitely many real number between any two different real numbers. Types of Set • Write set {1, 5, 15, 25,…} in set-builder form. a) {x: either x=1 or x=5n, where n is a real number} b) {x: either x=1 or x=5n, where n is a integer} c) {x: either x=1 or x=5n, where n is an odd natural number} d) {x: x=5n, where n is a natural number} Types of Set • Write set {1, 5, 15, 25,…} in set-builder form. a) {x: either x=1 or x=5n, where n is a real number} b) {x: either x=1 or x=5n, where n is a integer} c) {x: either x=1 or x=5n, where n is an odd natural number} d) {x: x=5n, where n is a natural number} View Answer • Answer: c Explanation: Set should include 1 or an odd multiple of 5. Types of Set • Number of power set of {a, b}, where a and b are distinct elements. a) 3 b) 4 c) 2 d) 5 Types of Set • Number of power set of {a, b}, where a and b are distinct elements. a) 3 b) 4 c) 2 d) 5 View Answer • Answer: b Explanation: Power set of {a, b} = {∅, {a, b}, {a}, {b}} Types of Set • Which of the following is subset of set {1, 2, 3, 4}? a) {1, 2} b) {1, 2, 3} c) {1} d) All of the mentioned Types of Set • Which of the following is subset of set {1, 2, 3, 4}? a) {1, 2} b) {1, 2, 3} c) {1} d) All of the mentioned View Answer • Answer: d Explanation: There are total 16 subsets. Types of Set A = { ,{ },2,{2,∅},3}, which of the following is true? • ∅∅ a) {{∅,{∅ }} ∈ A b) {2} ∈A c) ∅ ⊂A d) 3 ⊂A Types of Set • A = { ,{ },2,{2,∅},3}, which of the following is true? ∅∅ a) {{∅,{∅ }} ∈ A b) {2} ∈A c) ∅ ⊂A d) 3 ⊂A View Answer • Answer: c Explanation: Empty set is a subset of every set Types of Set • Subset of the set A= { } is? a) A b) {} c) ∅ d) All of the mentioned Types of Set • Subset of the set A= { } is? a) A b) {} c) ∅ d) All of the mentioned View Answer • Answer: d Explanation: Every set is subset of itself and Empty set is subset of each set. Types of Set • ∈ {x: x N and x is prime} then it is ________ a) Infinite set b) Finite set c) Empty set d) Not a set Types of Set • ∈ {x: x N and x is prime} then it is ________ a) Infinite set b) Finite set c) Empty set d) Not a set View Answer • Answer: a Explanation: There is no extreme prime, number of primes is infinite Types of Set • Convert set {x: x is a positive prime number which divides 72} in roster form. a) {2, 3, 5} b) {2, 3, 6} c) {2, 3} d) {∅} Types of Set • Convert set {x: x is a positive prime number which divides 72} in roster form. a) {2, 3, 5} b) {2, 3, 6} c) {2, 3} d) {∅} View Answer • Answer: c Explanation: 2 and 3 are the divisors of 72 which are prime