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

Mathematical

Reasoning
Join Vedantu JEE
Telegram
channel NOW!
Assignments
Notes
Daily Update

https://vdnt.in/JEEVedantu
Mathematical Reasoning
● Some basic terms involved
● Truth tables & logical equivalence
1. Some basic terms involved
Let’s first get familiar with all the basic terms involved in this topic.

(a) Statement
(b) Simple & Compound statements
(c) Logical Connective
(d) Negation of a statement
(e) Implications
(f) Converse & Contrapositive
(g) Quantifiers
(a) Statement:
A mathematically acceptable statement is a sentence, which is either
true or false but not both simultaneously. These are generally denoted
by ‘p’, ‘q’, ‘r’ etc.

Let p : Arvind Kalia sir is a Maths teacher.


q : Maths is difficult
(a) Statement:
A mathematically acceptable statement is a sentence, which is either
true or false but not both simultaneously. These are generally denoted
by ‘p’, ‘q’, ‘r’ etc.

Let p : Arvind Kalia sir is a Maths teacher.


q : Maths is difficult

Here, ‘p’ is a statement while ‘q’ is not


(b) Simple & Compound statements:
A statement which cannot be broken down into two or more
statements, is called simple statement. Otherwise it’s called compound
statement.

Let p : Some students pressed like button.


q : Mohit Ryan sir teaches Chemistry and Vinay Shur sir teaches physics.
r : If you study from Vedantu Jee then you will score good.
(b) Simple & Compound statements:
A statement which cannot be broken down into two or more
statements, is called simple statement. Otherwise it’s called compound
statement.

Let p : Some students pressed like button.


q : Mohit Ryan sir teaches Chemistry and Vinay Shur sir teaches physics.
r : If you study from Vedantu Jee then you will score good.
Here ‘p’ is a simple statement while ‘q’ & ‘r’ are compound statements.
(c) Logical Connective:

The connecting words “and” and “or” are called logical connectives,
these are also referred as “Conjunction” & “Disjunction” respectively.

Notation: Conjunction of ‘p’ & ‘q’ is denoted as p ∧ q


Disjunction of ‘p’ & ‘q’ is denoted by p ∨ q
(d) Negation of a statement:
The denial of a statement is called the negation of statement.

Notation: Negation of statement ‘p’ is denoted as ‘ ~p ’

p : Mr. Bean is not a comedian

q : 5 is greater than 7
(e) Implications:

The statement of the form “If …. then....” i.e. p ⇒ q is called


‘conditional statement’ & the statement of the form “….. if & only if
…..” i.e. p ⇔ q is called ‘Biconditional statement’.
(e) Implications:

The statement of the form “If …. then....” i.e. p ⇒ q is called


‘conditional statement’ & the statement of the form “….. if & only if
…..” i.e. p ⇔ q is called ‘Biconditional statement’.
(a) “If a number is multiple of 10 then it’s a multiple of 5”.
It is of the form p ⇒ q
(b) “Two lines are parallel iff they have equal slopes”
It is of the form p ⇔ q
(f) Converse & Contrapositive:

Consider a statement of the form p ⇒ q


(a) Its converse is q ⇒ p
(b) Its contrapositive is 〜q ⇒ 〜p
Consider “If you study hard, then Arvind sir will be happy.”
To write its converse & contrapositive, first observe, it is of the
form p ⇒ q where
p : You study hard.
q : Arvind sir will be happy.

So, converse is q ⇒ p i.e.


“________________________________________________”.

And contrapositive is i.e.


“________________________________________________”.
Consider “If you study hard, then Arvind sir will be happy.”
To write its converse & contrapositive, first observe, it is of the
form p ⇒ q where
p : You study hard.
q : Arvind sir will be happy.

So, converse is q ⇒ p i.e. “If Arvind sir is happy, then you must
be studying hard”.

And contrapositive is i.e. “If Arvind sir is not happy


then you must not be studying hard”.
NTA Abyas
The contrapositive of the statement “If two triangles are identical,
then they are similar” is

If two triangles are not similar, then


A they are not identical

If two triangles are not identical,


B then they are not similar

If two triangles are not identical,


C then they are similar

If two triangles are not similar, then


D they are identical
NTA Abyas
The contrapositive of the statement “If two triangles are identical,
then they are similar” is

If two triangles are not similar, then


A they are not identical

If two triangles are not identical,


B then they are not similar

If two triangles are not identical,


C then they are similar

If two triangles are not similar, then


D they are identical
Solution:

Let, p : Two triangles are identical


q : Two triangles are similar
Clearly, the given statement in symbolic form is p → q.
Contrapositive of p → q is ~ q → ~p
i.e., If two triangles are not similar, then they are not identical.
(g) Quantifiers:
The terms like “for all”, “there exists”, “for some”, “always”, “at least”
etc. are called quantifiers.
Negation of universal statement is existential statement & vice-versa

Eg: Consider, p : All crows are black


q : Atleast one crow is black
Negation of these statements are:
(g) Quantifiers:

Eg: Consider, p : All crows are black


q : Atleast one crow is black
Negation of these statements are:
Atleast one crow is not black
No crow is black
2. Truth table & logical equivalence

(a) “ ~ p”

(b) “ ”

(c) “ ”

(d) “ ”

(e) “ ”
(a) “ ~ p”
(a) “ ~ p”

Read “~ p” as pc
Observation
Negation of ‘Paris is in France and London is in England’ is

Paris is in England and London


A is in France

Paris is not in France or London


B is not in England

Paris is in England or London


C is in France

D None of the above


NOTE
While doing negation of compound statements, always prefer to
mention statements p and q first and then do negation.
Negation of ‘Paris is in France and London is in England’ is

Paris is in England and London


A is in France

Paris is not in France or London


B is not in England

Paris is in England or London


C is in France

D None of the above


Solution:

Here, let p : Paris is in France

and q : London is in England

Thus, we have

Its negation is i.e.

Hence, Paris is not in France or London is not in England


(b) “p ∧ q”
(b) “p ∧ q”

Read “p ∧ q” as P ∩ Q
Observation
is
(c) “p ∨ q”
(c) “p ∨ q”

Read “p ∨ q” as P ∪ Q
Observation
is
If p, q and r are any three logical statements, then which one of the
following is correct?

D
If p, q and r are any three logical statements, then which one of the
following is correct?

D
Solution:
Make truth table of
Solution: p q r ~p ~p ∧ q (~p ∧ q) ∨ r

T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F

NOTE
Try to observe how truth values of ‘p’, ‘q’ & ‘r’ are taken
(d) “p → q”

NOTE
is same as
(d) “p → q”

Read “p 🠆 q” as Pc ∪
Q

NOTE
is same as
The negation of is

D
The negation of is

D
Solution:
Negation of the conditional statement, ‘if it rains, then I shall go to
school’ is

It rains and I shall go to


A school

It rains and I shall not


B go to school

It does not rains and I


C shall go to school

D None of the above


Negation of the conditional statement, ‘if it rains, then I shall go to
school’ is

It rains and I shall go to


A school

It rains and I shall not


B go to school

It does not rains and I


C shall go to school

D None of the above


Solution:

Let p : It rains and q : I shall go to school


Thus, we have

Its negation is

Hence, it rains and I shall not go to school


If the truth value of the statement is false (F), then
the truth values of the statements p, q, r are respectively.

A T, T, F

B T, F, F

C T, F, T

D F, T, T
If the truth value of the statement is false (F), then
the truth values of the statements p, q, r are respectively.

A T, T, F

B T, F, F

C T, F, T

D F, T, T
Solution:

Given statement p → (~q ∨ r) is False


⇒ p is true and ~q ∨ r is false
⇒ p is true and ~q is false and r is false
∴ Truth values, p, q, r are T, T, F respectively.
If (p ∧ ~q) ∧ (p ∧ r) → ~p ∨ q is false, then the truth values of p, q and
r are respectively

A F, T, F

B T, F, T

C F, F, F

D T, T, T
If (p ∧ ~q) ∧ (p ∧ r) → ~p ∨ q is false, then the truth values of p, q and
r are respectively

A F, T, F

B T, F, T

C F, F, F

D T, T, T
Solution:
As the truth table for the (p ∧ ~q) ∧ (p ∧ r) → ~p ∨ q is false, then only
possible values of (p, q, r) is (T, F, T)

p q r ~q p ∧ ~q p∧r ~p ~p ∨ q (p ∧ ~q) ∧ (p ∧ r) (p ∧ ~q) ∧ (p∧ r) → p ∨ q

T T T F F T F T F T
T F T T T T F F T F
T T F F F F F T F T
F T T F F F T T F T
F F T T F F T T F T
F T F F F F T T F T
T F F T T F F F F T
F F F T F F T T F T
(e) “p ↔ q”

NOTE
(a) is same as
(e) “p ↔ q”

NOTE
(a) is same as
Consider, p : Arvind sir is loved by students, q : Arvind sir loves his
students & r : Arvind sir is not a teacher. “Arvind sir is a teacher and
is loved by students iff Arvind sir loves his students” can be
expressed as:

D
Consider, p : Arvind sir is loved by students, q : Arvind sir loves his
students & r : Arvind sir is not a teacher. “Arvind sir is a teacher and
is loved by students iff Arvind sir loves his students” can be
expressed as:

D
Solution:
The negation of ‘x ∈ R if and only if |x| ≥ 0’ is….

A {x ∈ R+ and |x| > 0} and {|x| > 0 and x ∈ R}

B {x ∈ R and |x| > 0} or {|x| ≥ 0 and x ∉ R}

C {x ∈ R and |x| ≥ 0} or {|x| ≥ 0 and x ∉ R}

D {x ∈ R+ and |x| > 0} and {|x| < 0 and x ∉ R}


The negation of ‘x ∈ R if and only if |x| ≥ 0’ is….

A {x ∈ R+ and |x| > 0} and {|x| > 0 and x ∈ R}

B {x ∈ R and |x| > 0} or {|x| ≥ 0 and x ∉ R}

C {x ∈ R and |x| ≥ 0} or {|x| ≥ 0 and x ∉ R}

D {x ∈ R+ and |x| > 0} and {|x| < 0 and x ∉ R}


Solution:

Here p : x ∈ R and q : |x| ≥ 0 are given statements.


Here p ⇔ q is a biconditional statement. Its negation is,
~(p ⇔ q) = ~[(p ⇒ q) ∧ (q ⇒ p)]
= ~(p ⇒ q) ∨ ~(q ⇒ p)
= (p ∧ (~q)) ∨ (q ∧ (~p))
Negation of given statement = {x ∈ R and |x| ≥ 0} or {|x| ≥ 0 and x ∉ R}.
NOTE
Statement that is always true is called Tautology & the statement
that is never true is called Fallacy or Contradiction and statement
that is neither is called contingency.
Which of the following statements is a tautology?

D
Which of the following statements is a tautology?

D
Solution:
Here,

Thus, is tautology
JEE Main 25th July, 2022 - Shift 1

Which of the following statements is a tautology?

A ((~p) ∨ q) ⇒ p

B p ⇒ ((~p) ∨ q)

C ((~p) ∨ q) ⇒ q

D q ⇒ ((~p) ∨ q)
JEE Main 25th July, 2022 - Shift 1

Which of the following statements is a tautology?

A ((~p) ∨ q) ⇒ p

B p ⇒ ((~p) ∨ q)

C ((~p) ∨ q) ⇒ q

D q ⇒ ((~p) ∨ q)
Solution:

Options
p q ~p ~q ~pvq A B C D

T T F F T T T T T

T F F T F T F T T

F T T F T F T T T

F F T T T F T F T
NOTE
If two statements have same truth values or if they represent same
regions in venn diagram then they are called logically equivalent.
JEE Main 2015

The negation of is equivalent to

D
JEE Main 2015

The negation of is equivalent to

D
Solution:

Alternate approach: Use Venn diagrams


JEE Main 26th July, 2022 - Shift 1

The statement (~(p ⇔ ~q)) ∧ q is:

A A tautology

B A contradiction

C Equivalent to (p ⇒ q) ∧ q

D Equivalent to (p ⇒ q) ∧ p
JEE Main 26th July, 2022 - Shift 1

The statement (~(p ⇔ ~q)) ∧ q is:

A A tautology

B A contradiction

C Equivalent to (p ⇒ q) ∧ q

D Equivalent to (p ⇒ q) ∧ p
Solution:

(~(p ⇔ ~q) ∧ q ≡ (p ⇔ q) ∧ q
(p ⇔ q) ∧ q ≡ p ∧ q

p⇔q p→q
JEE Main 25th June, 2022 - Shift 2
The negation of the Boolean expression ((~ q) ∧ p) ⇒ ((~ p) ∨ q) is
logically equivalent to

A p⇒q

B q⇒p

C ~(p ⇒ q)

D ~(q ⇒ p)
JEE Main 25th June, 2022 - Shift 2
The negation of the Boolean expression ((~ q) ∧ p) ⇒ ((~ p) ∨ q) is
logically equivalent to

A p⇒q

B q⇒p

C ~(p ⇒ q)

D ~(q ⇒ p)
Solution:

~p ∨ q ≡ p → q
~q ∧ p ≡ ~(p → q)
Negation of ~(p → q) → (p → q) is
~(p → q) ∧ (~(p → q))
i.e., ~(p → q)
Join Vedantu JEE
Telegram
channel NOW!
Assignments
Notes
Daily Update

https://vdnt.in/JEEVedantu

You might also like