Download as pdf or txt
Download as pdf or txt
You are on page 1of 38

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:

● A compound statement is a statement which is made up of two or more


statements. Each of this statements is termed to be a compound statement.
● The compound statements are combined by the word “and” ( ^ ) the
resulting statement is called a conjunction denoted as p ∧ q.
● The compound statements with “And” is true if all its component statements
are true.
Mathematical Reasoning

Negation of a Statement:

The denial of a statement is called the negation of the statement.


Mathematical Reasoning

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.

Truth Table (~p)

p ~p ~(~p)

T F T

F T F
Mathematical Reasoning

AND Truth table

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

● p ∧ q is true only when p and q are true


Mathematical Reasoning

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

● p ∨ q is false only when both p and q are false


Mathematical Reasoning

Implication or Conditional Truth table

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

● p ⇢ q is false only when p is true and q is false


Mathematical Reasoning

Double-Implication or Bi-Conditional Truth table

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 :

JEE (Main) 2018

A ∼q

B ∼p

C p

D q
Q. The Boolean expression ∼ (p v q) v (∼ p ∧ q) is equivalent to :

JEE (Main) 2018


A ∼q B ∼p C p D q
(∼p ∧ ∼q) v (∼ p ∧ q) = ∼p ∧ (∼p v q)=∼p
Solution:
Alternate solution

p q pvq ∼p ∼p ∧ q ∼(p v q) ∼(p v q) v (∼p ∧ q)


T T T F F F F

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:

JEE-Main 2019 (8th April-1st shift)

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
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

Solution: JEE-Main 2019 (8th April-1st shift)

The contrapositive of a statement p ➝ q is 〜q ➝ 〜 p


Here, p : your are born in India
q : you are citizen of India
So, contrapositive of above statement is “If you are not a citizen of India,
then you are not born in India”.
Mathematical Reasoning

Important points on tautology and fallacy:


● p ∨ q is true iff at least on p and q is true
● p ∧ q is true iff both p and q are true
● A tautology is always true
● A fallacy is always false.
Q. The following statement (p →q) → [(~p→q)→q] is:

A a tautology JEE (Main) 2017

B equivalent to ~p →q

C equivalent to p→~q

D a fallacy
Q. The following statement (p →q) → [(~p→q)→q] is:

A a tautology JEE (Main) 2017


B equivalent to ~p →q

C equivalent to p→~q D a fallacy

Solution: (p → q)→ ((~p → q) → q)


= ~(p → q) V ((p ∧ q) → q)
= ~(p → q) V ((~p ∧ ~q) ∨ q)
= ~(p → q) V ((~p ∨ q) (~q ∨ q))
= ~(p → q) V (~p ∨ q)
= ~(p → q) V (p → q)
=T
Q. Consider : Statement − I : is a fallacy.
Statement − II : is a tautology.
JEE (Main) 2013
Statement - I is True; Statement -II is true; Statement-II is not a correct
A
explanation for Statement-I
B Statement -I is True; Statement -II is False.

C Statement -I is False; Statement -II is True

D Statement -I is True; Statement -II is True; Statement-II is a correct


explanation for Statement-I
Q. Consider : Statement − I : is a fallacy.
Statement − II : is a tautology.
JEE (Main) 2013
Statement - I is True; Statement -II is true; Statement-II is not a correct
A
explanation for Statement-I
B Statement -I is True; Statement -II is False.

C Statement -I is False; Statement -II is True

D Statement -I is True; Statement -II is True; Statement-II is a correct


explanation for Statement-I
Mathematical Reasoning

Logical Equivalences.

Equivalence Name

p∨F≡p Identity laws


p∧T≡p

p∨T≡T Domination laws


p∧F≡F

p∨p≡p Idempotent laws


p∧p≡p

~(~p) ≡ p Double negation laws

p∨p≡q∨p Commutative laws


p∧p≡q∧p

(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) ≡ ~p ∨ ~q De Morgan’s laws


~(p ∨ q) ≡ ~p ∧~q

p ∨ (q ∧ q) ≡ p Absorption laws
p ∧ (q ∨ q) ≡ p

p ∨ ~p ≡ T Negation laws
p ∧ ~p ≡ F
Mathematical Reasoning

Logical Equivalences Involving Statements.

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

Logical Equivalences Involving Biconditional


Statements.

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:

JEE-Main 2019 (8th April-2nd shift)

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:

JEE (Main) 2016


A p∧q

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

You might also like