Professional Documents
Culture Documents
Mathematical Reasoning
Mathematical Reasoning
Mathematical Reasoning
Mathematical Reasoning
Mathematical Reasoning
Mathematical Reasoning
Mathematical Reasoning
● A sentence is called a mathematically acceptable statement if it is
either true or false but not both.
Mathematical Reasoning
Compound Statement:
Mathematical Reasoning
Compound Statement:
Negation of a Statement:
Truth Table:
Mathematical Reasoning
Truth Table:
A truth table is a mathematical table used to determine if a compound
statement is true or false.
Mathematical Reasoning
Truth Table:
A truth table is a mathematical table used to determine if a compound
statement is true or false.
p ~p ~(~p)
T F T
F T F
Mathematical Reasoning
Truth Table (p ∧ q, q ∧ p)
p q p∧q q∧p
T T T T
T F F F
F T F F
F F F F
OR Truth table
Truth Table (p ∨ q, q ∨ p)
p q p∨q q∨p
T T T T
T F T T
F T T T
F F F F
Truth Table (p ⇢ q. q ⇢ p)
p q p⇢q q⇢p
T T T T
T F F T
F T T F
F F T T
Truth Table (p ↔ q. q ↔ p)
p q p↔q q↔p
T T T T
T F F F
F T F F
F F T T
● p ↔ q is true only when both p and q have the same truth value
Q. The Boolean expression ∼ (p v q) v (∼ p ∧ q) is equivalent to :
A ∼q
B ∼p
C p
D q
Q. The Boolean expression ∼ (p v q) v (∼ p ∧ q) is equivalent to :
T F T F F F F
F T T T T F T
F F F T F T T
Q. The contrapositive of the statement “If you are born in India, then
you are a citizen of India”, is:
B If you are not a citizen of India, then you are not born in India
C If you are no born in India, then you are not a citizen of India
D If you are born in India, then you are not a citizen of India
Q. The contrapositive of the statement “If you are born in India, then
you are a citizen of India”, is:
A If you are a citizen of India, then you are born in India
B If you are not a citizen of India, then you are not born in India
C If you are no born in India, then you are not a citizen of India
D If you are born in India, then you are not a citizen of India
B equivalent to ~p →q
C equivalent to p→~q
D a fallacy
Q. The following statement (p →q) → [(~p→q)→q] is:
Logical Equivalences.
Equivalence Name
(p ∨ q) ∨ r ≡ p ∨ (q ∨ r) Associative laws
(p ∧ q) ∧ r ≡ p ∧ (q ∧ r)
Mathematical Reasoning
(p ∨ q) ∨ r ≡ p ∨ (q ∨ r) Associative laws
(p ∧ q) ∧ r ≡ p ∧ (q ∧ r)
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) Distributive laws
p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
p ∨ (q ∧ q) ≡ p Absorption laws
p ∧ (q ∨ q) ≡ p
p ∨ ~p ≡ T Negation laws
p ∧ ~p ≡ F
Mathematical Reasoning
p ⇢ q ≡ ~p ∨ q
p ⇢ q ≡ ~q ⇢~ p
p ∨ q ≡ ~(p ⇢ ~q)
~(p ⇢ q) ≡ p ∧ ~q
(p ⇢ q) ∧ (p ⇢ r) ≡ p ⇢(q ∧ r)
(p ⇢ r) ∧ (q ⇢ r) ≡ (p ∨ q) ⇢ r
(p ⇢ q) ∨ (p ⇢ r) ≡ p ⇢ (q ∨ r)
(p ⇢ r) ∨ (q ⇢ r) ≡ (p ∧ q) ⇢ r
p ↔ q ≡ (p ⇢ q) ∧ (q ⇢ p)
p ↔ q ≡ ~p ↔ ~q
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
~(p ↔ q) ≡ p ↔ ~q
Q. Which one of the following, statements is not a tautology:
A ( p v q ) ⟶ ( p v ( ~ q))
B (pvq)⟶p
C P⟶(pvq)
D (p^q)⟶(~p)vq
Q. Which one of the following, statements is not a tautology:
A ( p v q ) ⟶ ( p v ( ~ q)) B (pvq)⟶p
C P⟶(pvq) D (p^q)⟶(~p)vq
Solution: JEE-Main 2019 (8th April-2nd shift)
Q. The Boolean Expression (p∧〜q) vqv (〜p∧q) is equivalent to:
B p∨q
C p ∨ 〜q
D 〜p ∧ q
Q. The Boolean Expression (p∧〜q) vqv (〜p∧q) is equivalent to:
A p∧q B p∨q C p ∨ 〜q D 〜p ∧ q
JEE (Main) 2016
Solution:
Mathematical Reasoning