Questions logic and proofs

1. Which of the following statement is a proposition?

a) Get me a glass of milkshake
b) God bless you!
c) What is the time now?
d) The only odd prime number is2
Answer: d
Explanation: Only this statement has got the truth value which is false.

2. The truth value of ‘4+3=7 or 5 is not prime’.

a) False
b) True
Answer: b
Explanation: Compound statement with ‘or’ is true when either of the
statement is true. Here the first part of the statement is true, hence
the whole is true.

3. Which of the following option is true?

a) If the Sun is a planet, elephants will fly
b) 3 +2 = 8 if 5-2 = 7
c) 1 > 3 and 3 is a positive integer
d) -2 > 3 or 3 is a negative integer
Answer: a
Explanation: Hypothesis is false, thus the whole statement is true.

4. What is the value of x after this statement, assuming the initial

value of x is 5?‘If x equals to one then x=x+2 else x=0’.
a) 1
b) 3
c) 0
d) 2
Answer: c
Explanation: If condition is false so value decided according to else
condition.

5. Let P: I am in Bangalore.; Q: I love cricket.; then q -> p(q implies p)

is?
a) If I love cricket then I am in Bangalore
b) If I am in Bangalore then I love cricket
c) I am not in Bangalore
d) I love cricket
Answer: a
Explanation: Q is hypothesis and P is conclusion. So the compound
statement will be if hypothesis then conclusion.

6. Let P: If Sahil bowls, Saurabh hits a century.; Q: If Raju bowls, Sahil

gets out on first ball. Now if P is true and Q is false then which of the
following can be true?
a) Raju bowled and Sahil got out on first ball
b) Raju did not bowled
c) Sahil bowled and Saurabh hits a century
d) Sahil bowled and Saurabh got out
Answer: c
Explanation: Either hypothesis should be false or both (hypothesis and
conclusion) should be true.

7. The truth value ‘9 is prime then 3 is even’.

a) False
b) True
Answer: b
Explanation: The first part of the statement is false, hence whole is
true.

8. Let P: I am in Delhi.; Q: Delhi is clean.; then q ^ p(q and p) is?

a) Delhi is clean and I am in Delhi
b) Delhi is not clean or I am in Delhi
c) I am in Delhi and Delhi is not clean
d) Delhi is clean but I am in Mumbai
Answer: a
Explanation: Connector should be ‘and’, that is q and p.

9. Let P: This is a great website, Q: You should not come back here.
Then ‘This is a great website and you should come back here.’ is best
represented by?
a) ~P V ~Q
b) P ∧ ~Q
c) P V Q
d) P ∧ Q
Answer: b
Explanation: The second part of the statement is negated, hence
negation operator is used.

10. Let P: We should be honest., Q: We should be dedicated., R: We

should be overconfident. Then ‘We should be honest or dedicated
but not overconfident.’ is best represented by?
a) ~P V ~Q V R
b) P ∧ ~Q ∧ R
c) P V Q ∧ R
d) P V Q ∧ ~R
Answer: d
Explanation: The third part of the statement is negated, hence
negation operator is used, for (‘or’ –V) is used and for(’but’- ∧).

11. Which of the following bits is the negation of the bits “010110”?
a) 111001
b) 001001
c) 101001
d) 111111
Answer: c
Explanation: Flip each of the bit to get the negation of the required
string.

12. Which of the following option is suitable, if A is “10110110”, B

is”11100000” and C is”10100000”?
a) C=A or B
b) C=~A
c) C=~B
d) C=A and B
Answer: d
Explanation: Output of and is 1 when both other inputs are one.

13. How many bits string of length 4 are possible such that they
contain 2 ones and 2 zeroes?
a) 4
b) 2
c) 5
d) 6
Answer: d
Explanation: The strings are {0011, 0110, 1001, 1100, 1010 and 0101}.
14. If a bit string contains {0, 1} only, having length 5 has no more
than 2 ones in it. Then how many such bit strings are possible?
a) 14
b) 12
c) 15
d) 16
Answer: d
Explanation: The total strings are 1(having no one in it) +5(having 1 one
in it) +10 (having 2 ones in it) = 16.

15. If A is “001100” and B is “010101” then what is the value of A (Ex-

or) B?
a) 000000
b) 111111
c) 001101
d) 011001
Answer: d
Explanation: In Ex-or if both the inputs are same then output is 0
otherwise 1.

16. The Ex-nor of this string “01010101” with “11111111” is?

a) 10101010
b) 00110100
c) 01010101
d) 10101001
Answer: c
Explanation: In Ex-nor if both the inputs are same then output is 1
otherwise 0.
17. What is the one’s complement of this string “01010100”?
a) 10101010
b) 00110101
c) 10101011
d) 10101001
Answer: c
Explanation: Negate every bit in one’s complement.

18. What is the 2’s complement of this string “01010100”?

a) 10101010
b) 00110100
c) 10101100
d) 10101001
Answer: c
Explanation: In two’s complement negate every bit from left until the
first one from right is encountered.

19. If in a bits string of {0,1}, of length 4, such that no two ones are
together. Then the total number of such possible strings are?
a) 1
b) 5
c) 7
d) 4
Answer: c
Explanation: Strings can be {1001, 1010, 0101, 1000, 0100, 0010,
0001}.

20. Let A: “010101”, B=?, If { A (Ex-or) B } is a resultant string of all

ones then which of the following statement regarding B is correct?
a) B is negation of A
b) B is 101010
c) {A (and) B} is a resultant string having all zeroes
d) All of the mentioned
Answer: d
Explanation: In Ex-or both if both the inputs are the same then output
is 0 otherwise 1.

21. Let P and Q be statements, then P<->Q is logically equivalent to:

a) P<->~Q
b) ~P<->Q
c) ~P<->~Q
d) None of the mentioned
Answer: c
Explanation: Both of them have same truth table, Hence they are
equal.

22. What is the negation of the statement A->(B v(or) C)?

a) A ∧ ~B ∧ ~C
b) A->B->C
c) ~A ∧ B v C
d) None of the mentioned
Answer: a
Explanation: A->P is logically equivalent to ~A v P.

23. The compound statement A-> (A->B) is false, then the truth values
of A, B are respectively _________
a) T, T
b) F, T
c) T, F
d) F, F
Answer: c
Explanation: For implications to be false hypothesis should be true and
conclusion should be false.

24. The statement which is logically equivalent to A∧ (and) B is?

a) A->B
b) ~A ∧ ~ B
c) A ∧ ~B
d) ~(A->~B)
Answer: d
Explanation: The truth table of both statements are same.

25. Let P: We give a nice overall squad performance, Q: We will win

the match.Then the symbolic form of “We will win the match if and
only if we give a nice overall squad performance.“ is?
a) P v Q
b) Q ∧ P
c) Q<->P
d) ~P v Q
Answer: c
Explanation: If and only if statements are bi-conditionals.

26. Let P, Q, R be true, false true, respectively, which of the following

is true?
a) P∧Q∧R
b) P∧~Q∧~R
c) Q->(P∧R)
d) P->(Q∧R)
Answer: c
Explanation: Hypothesis is false, hence statement is true.
27. “Match will be played only if it is not a humid day.” The negation
of this statement is?
a) Match will be played but it is a humid day
b) Match will be played or it is a humid day
c) All of the mentioned statement are correct
d) None of the mentioned
Answer: a
Explanation: Negation of P->Q is P∧~Q.

28. Consider the following statements.

A: Raju should exercise.
B: Raju is not a decent table tennis player.
C: Raju wants to play good table tennis.
The symbolic form of “Raju is not a decent table tennis player and if
he wants to play good table tennis then he should exercise.” is?
a) A->B->C
b) B∧(C->A)
c) C->B∧A
d) B<->A∧C
Answer: b
Explanation: For conditionals statement (if then), implications are used.

29. The statement (~P<->Q)∧~Q is true when?

a) P: True Q: False
b) P: True Q: True
c) P: False Q: True
d) P: False Q: False
Answer: a
Explanation: For a bi-conditional to be true both inputs should be
same.
30. Let P, Q, R be true, false, false, respectively, which of the
following is true?
a) P∧(Q∧~R)
b) (P->Q)∧~R
c) Q<->(P∧R)
d) P<->(QvR)
Answer: c
Explanation: For a bi-conditional to be true both inputs should be the
same.

31. Which of the following statements is the negation of the

statements “4 is odd or -9 is positive”?
a) 4 is even or -9 is not negative
b) 4 is odd or -9 is not negative
c) 4 is even and -9 is negative
d) 4 is odd and -9 is not negative
Answer: c
Explanation: Using De Morgan’s Law ~(A V B) ↔ ~A ∧ ~B.

32. Which of the following represents: ~A (negation of A) if A stands

for “I like badminton but hate maths”?
a) I hate badminton and maths
b) I do not like badminton or maths
c) I dislike badminton but love maths
d) I hate badminton or like maths
Answer: d
Explanation: De Morgan’s Law ~ (A ∧ B) ↔ ~A V ~B.

33. The compound statement A v ~(A ∧ B).

a) True
b) False
Answer: a
Explanation: Applying De-Morgan’s law we get A v ~ A Ξ Tautology.

34. Which of the following is De-Morgan’s law?

a) P ∧ (Q v R) Ξ (P ∧ Q) v (P ∧ R)
b) ~(P ∧ R) Ξ ~P v ~R, ~(P v R) Ξ ~P ∧ ~R
c) P v ~P Ξ True, P ∧ ~P Ξ False
d) None of the mentioned
Answer: b
Explanation: Definition of De–Morgan’s Law.

35. What is the dual of (A ∧ B) v (C ∧ D)?

a) (A V B) v (C v D)
b) (A V B) ^ (C v D)
c) (A V B) v (C ∧ D)
d) (A ∧ B) v (C v D)
Answer: b
Explanation: In dual ∧ is replaced by v and vice – versa.

36. ~ A v ~ B is logically equivalent to?

a) ~ A → ~ B
b) ~ A ∧ ~ B
c) A → ~B
d) B V A
Answer: c
Explanation: By identity A → B Ξ ~A V B.
37. Negation of statement (A ∧ B) → (B ∧ C) is _____________
a) (A ∧ B) →(~B ∧ ~C)
b) ~(A ∧ B) v ( B v C)
c) ~(A →B) →(~B ∧ C)
d) None of the mentioned
Answer: a
Explanation: ~(A →B) Ξ A ∧ ~B using this we can easily fetch the
answer.

38. Which of the following satisfies commutative law?

a) ∧
b) v
c) ↔
d) All of the mentioned
Answer: d
Explanation: All of them satisfies commutative law.

39. If the truth value of A v B is true, then truth value of ~A ∧ B can be

___________
a) True if A is false
b) False if A is false
c) False if B is true and A is false
d) None of the mentioned
Answer: a
Explanation: If A is false then both the condition are obeyed.

40. If P is always against the testimony of Q, then the compound

statement P→(P v ~Q) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
Answer: a
Explanation: Since either hypothesis is false or both (hypothesis as well
as conclusion) are true.

41. A compound proposition that is always ___________ is called a

tautology.
a) True
b) False
Answer: a
Explanation: Tautology is always true.

42. A compound proposition that is always ___________ is called a

contradiction.
a) True
b) False
Answer: b
Explanation: Contradiction is always false.
43. If A is any statement, then which of the following is a tautology?
a) A ∧ F
b) A ∨ F
c) A ∨ ¬A
d) A ∧ T
Answer: c
Explanation: A ∨ ¬A is always true.

44. If A is any statement, then which of the following is not a

contradiction?
a) A ∧ ¬A
b) A ∨ F
c) A ∧ F
d) None of mentioned
Answer: b
Explanation: A ∨ F is not always false.

45. A compound proposition that is neither a tautology nor a

contradiction is called a ___________
a) Contingency
b) Equivalence
c) Condition
d) Inference
Answer: a
Explanation: Definition of contingency.

46. ¬ (A ∨ q) ∧ (A ∧ q) is a ___________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
Answer: b
Explanation: ≡ (¬A ∧ ¬q) ∧ (A ∧ q)
≡ (¬A ∧ A) ∧ (¬q ∧ q)
≡ F ∧ F ≡ F.

47. (A ∨ ¬A) ∨ (q ∨ T) is a __________

a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
Answer: a
Explanation: ≡ (A ∨ ¬A) ∨ (q ∨ T)
≡ T ∨ T ≡ T.

48. A ∧ ¬(A ∨ (A ∧ T)) is always __________

a) True
b) False
Answer: b
Explanation: ≡ A ∧ ¬ (A ∨ (A ∧ T))
≡ A ∧ ¬(A ∨ A)
≡ A ∧ ¬A ≡ F.
49. (A ∨ F) ∨ (A ∨ T) is always _________
a) True
b) False
Answer: a
Explanation: ≡ (A ∨ F) ∨ (A ∨ T)
≡ A ∨ T ≡ T.

50. A → (A ∨ q) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
Answer: a
Explanation: ≡ A → (A ∨ q)
≡ ¬A ∨ (A ∨ q)
≡ (A ∨ ¬A) ∨ q
≡ T ∨ q ≡ T.
51. The contrapositive of p → q is the proposition of ____________
a) ¬p → ¬q
b) ¬q → ¬p
c) q → p
d) ¬q → p
Answer: b
Explanation: Definition of contrapositive.

52. The inverse of p → q is the proposition of ____________

a) ¬p → ¬q
b) ¬q → ¬p
c) q → p
d) ¬q → p
Answer: a
Explanation: Definition of inverse.

53. The converse of p → q is the proposition of _______________

a) ¬p → ¬q
b) ¬q → ¬p
c) q → p
d) ¬q → p
Answer: c
Explanation: Definition of converse.

54. What is the contrapositive of the conditional statement? “The

home team misses whenever it is drizzling?”
a) If it is drizzling, then home team misses
b) If the home team misses, then it is drizzling
c) If it is not drizzling, then the home team does not misses
d) If the home team wins, then it is not drizzling
Answer: d
Explanation: q whenever p contrapositive is ¬q → ¬p.

55. What is the converse of the conditional statement “If it ices today,
I will play ice hockey tomorrow.”
a) “I will play ice hockey tomorrow only if it ices today.”
b) “If I do not play ice hockey tomorrow, then it will not have iced
today.”
c) “If it does not ice today, then I will not play ice hockey tomorrow.”
d) “I will not play ice hockey tomorrow only if it ices today.”
Answer: a
Explanation: If p, then q has converse q → p.

56. What are the contrapositive of the conditional statement “I come

to class whenever there is going to be a test.”
a) “If I come to class, then there will be a test.”
b) “If I do not come to class, then there will not be a test.”
c) “If there is not going to be a test, then I don’t come to class.”
d) “If there is going to be a test, then I don’t come to class.”
Answer: b
Explanation: q whenever p, has contrapositive ¬q → ¬p.

57. What are the inverse of the conditional statement “ A positive

integer is a composite only if it has divisors other than 1 and itself.”
a) “A positive integer is a composite if it has divisors other than 1 and
itself.”
b) “If a positive integer has no divisors other than 1 and itself, then it is
not composite.”
c) “If a positive integer is not composite, then it has no divisors other
than 1 and itself.”
d) None of the mentioned
Answer: c
Explanation: p only if q has inverse ¬p → ¬q.
58. What are the converse of the conditional statement “When Raj
stay up late, it is necessary that Raj sleep until noon.”
a) “If Raj stay up late, then Raj sleep until noon.”
b) “If Raj does not stay up late, then Raj does not sleep until noon.”
c) “If Raj does not sleep until noon, then Raj does not stay up late.”
d) “If Raj sleep until noon, then Raj stay up late.”
Answer: d
Explanation: Necessary condition for p is q has converse q → p.

59. What are the contrapositive of the conditional statement “Medha

will find a decent job when she labour hard.”?
a) “If Medha labour hard, then she will find a decent job.”
b) “If Medha will not find a decent job, then she not labour hard.”
c) “If Medha will find a decent job, then she labour hard.”
d) “If Medha not labour hard, then she will not find a decent job.”
Answer: b
Explanation: The statement q when p has its contrapositive as ¬q → ¬p.

60. What are the inverse of the conditional statement “If you make
your notes, it will be a convenient in exams.”
a) “If you make notes, then it will be a convenient in exams.”
b) “If you do not make notes, then it will not be a convenient in
exams.”
c) “If it will not be a convenient in exams, then you did not make your
notes.”
d) “If it will be a convenient in exams, then you make your notes
Answer: b
Explanation: If p then q has inverse ¬p → ¬q.

61. The compound propositions p and q are called logically equivalent

if ________ is a tautology.
a) p ↔ q
b) p → q
c) ¬ (p ∨ q)
d) ¬p ∨ ¬q
Answer: a
Explanation: Definition of logical equivalence.

62. p → q is logically equivalent to ________

a) ¬p ∨ ¬q
b) p ∨ ¬q
c) ¬p ∨ q
d) ¬p ∧ q
Answer: c
Explanation: (p → q) ↔ (¬p ∨ q) is tautology.

63. p ∨ q is logically equivalent to ________

a) ¬q → ¬p
b) q → p
c) ¬p → ¬q
d) ¬p → q
Answer: d
Explanation: (p ∨ q) ↔ (¬p → q) is tautology.
64. ¬ (p ↔ q) is logically equivalent to ________
a) q↔p
b) p↔¬q
c) ¬p↔¬q
d) ¬q↔¬p
Answer: b
Explanation: ¬(p↔q)↔(p↔¬q) is tautology.

65. p ∧ q is logically equivalent to ________

a) ¬ (p → ¬q)
b) (p → ¬q)
c) (¬p → ¬q)
d) (¬p → q)
Answer: a
Explanation: (p ∧ q) ↔ (¬(p → ¬q)) is tautology.

66. Which of the following statement is correct?

a) p ∨ q ≡ q ∨ p
b) ¬(p ∧ q) ≡ ¬p ∨ ¬q
c) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r)
d) All of mentioned
Answer: d
Explanation: Verify using truth table, all are correct.

67. p ↔ q is logically equivalent to ________

a) (p → q) → (q → p)
b) (p → q) ∨ (q → p)
c) (p → q) ∧ (q → p)
d) (p ∧ q) → (q ∧ p)
Answer: c
Explanation: (p ↔ q) ↔ ((p → q) ∧ (q → p)) is tautology.

68. (p → q) ∧ (p → r) is logically equivalent to ________

a) p → (q ∧ r)
b) p → (q ∨ r)
c) p ∧ (q ∨ r)
d) p ∨ (q ∧ r)
Answer: a
Explanation: ((p → q) ∧ (p → r)) ↔ (p → (q ∧ r)) is tautology.

69. (p → r) ∨ (q → r) is logically equivalent to ________

a) (p ∧ q) ∨ r
b) (p ∨ q) → r
c) (p ∧ q) → r
d) (p → q) → r
Answer: c
Explanation: ((p → r) ∨ (q → r)) ↔ ((p ∧ q) → r) is tautology.

70. ¬ (p ↔ q) is logically equivalent to ________

a) p ↔ ¬q
b) ¬p ↔ q
c) ¬p ↔ ¬q
d) ¬q ↔ ¬p
Answer: a
Explanation: (¬ (p ↔ q)) ↔ (p ↔ ¬q) is tautology.

71. Let P (x) denote the statement “x >7.” Which of these have truth
value true?
a) P (0)
b) P (4)
c) P (6)
d) P (9)
Answer: d
Explanation: Put x=9, 9>7 which is true.

72. Let Q(x) be the statement “x < 5.” What is the truth value of the
quantification ∀xQ(x), having domains as real numbers.
a) True
b) False
Answer: b
Explanation: Q(x) is not true for every real number x, because, for
instance, Q(6) is false. That is, x = 6 is a counterexample for the
statement ∀xQ(x). This is false.

73. Determine the truth value of ∀n(n + 1 > n) if the domain consists
of all real numbers.
a) True
b) False
Answer: a
Explanation: There are no elements in the domain for which the
statement is false.

74. Let P(x) denote the statement “x = x + 7.” What is the truth value
of the quantification ∃xP(x), where the domain consists of all real
numbers?
a) True
b) False
Answer: b
Explanation: Because P(x) is false for every real number x, the
existential quantification of Q(x), which is ∃xP(x), is false.

75. Let R (x) denote the statement “x > 2.” What is the truth value of
the quantification ∃xR(x), having domain as real numbers?
a) True
b) False
Answer: a
Explanation: Because “x > 2” is sometimes true—for instance, when x =
3–the existential quantification of R(x), which is ∃xR(x), is true.

76. The statement,” Every comedian is funny” where C(x) is “x is a

comedian” and F (x) is “x is funny” and the domain consists of all
people.
a) ∃x(C(x) ∧ F (x))
b) ∀x(C(x) ∧ F (x))
c) ∃x(C(x) → F (x))
d) ∀x(C(x) → F (x))
Answer: d
Explanation: For every person x, if comedian then x is funny.
77. The statement, “At least one of your friends is perfect”. Let P (x)
be “x is perfect” and let F (x) be “x is your friend” and let the domain
be all people.
a) ∀x (F (x) → P (x))
b) ∀x (F (x) ∧ P (x))
c) ∃x (F (x) ∧ P (x))
d) ∃x (F (x) → P (x))
Answer: c
Explanation: For some x, x is friend and funny.
78. ”Everyone wants to learn cosmology.” This argument may be true
for which domains?
a) All students in your cosmology class
b) All the cosmology learning students in the world
c) Both of the mentioned
d) None of the mentioned
Answer: c
Explanation: Domain may be limited to your class or may be whole
world both are good as it satisfies universal quantifier.

79. Let domain of m includes all students, P (m) be the statement “m

spends more than 2 hours in playing polo”. Express ∀m ¬P (m)
quantification in English.
a) A student is there who spends more than 2 hours in playing polo
b) There is a student who does not spend more than 2 hours in playing
polo
c) All students spends more than 2 hours in playing polo
d) No student spends more than 2 hours in playing polo
Answer: d
Explanation: There is no student who spends more than 2 hours in
playing polo.

80. Determine the truth value of statement ∃n (4n = 3n) if the domain
consists of all integers.
a) True
b) False
Answer: a
Explanation: For n=0, 4n=3n hence, it is true.
81. 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)))
Answer: a
Explanation: Definition of direct proof.

82. Which of the following can only be used in disproving the

statements?
a) Direct proof
b) Contrapositive proofs
c) Counter Example
d) Mathematical Induction
Answer: c
Explanation: Counter examples cannot be used to prove results.

83. 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)))
Answer: d
Explanation: Definition of proof by contraposition.
84. 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
Answer: c
Explanation: Definition of vacuous proof.
85. 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
Answer: b
Explanation: Definition of proof by contradiction.

86. 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
Answer: d
Explanation: Definition of exhaustive proof.

87. 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
Answer: a
Explanation: Some examples are not valid in proving results.

88. 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
Answer: c
Explanation: Definition of proof by cases.

89. 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
Answer: c
Explanation: Definition of trivial proof.

90. A theorem used to prove other theorems is known as :

a) Lemma
b) Corollary
c) Conjecture
d) None of the mentioned
Answer: a
Explanation: Definition of lemma.