MATHEMATICAL REASONING

HINTS & SOLUTIONS

EXERCISE - 1 17.  (p  q)  (q  r) is false
Single Choice
 (p  q) and (q  r) both are false
6.  p and r both are false or q is false.
otherwise (p  q)  (q  r) is true
p q ~p p q ~(p q) ~p q
T T F T F F
18. The negation of ‘’Everyone in Germany speaks German’’
T F F F T T
F T T F T T is - there is at least one person in Germany who does not
F F T T F F
speak German.
7. Both statements p and q are true 20. ~(p  (q  r))  p  ~(q  r)
so p q and q p ( ~(p  q)  p  ~q)
 p q  p  (~q  ~r)

8. When p and q both are true then 21.  ~q ~p  ~(~q)~p ( p  q  ~ p  q)

~(p  q) and (~p  ~q) both are false q~p
i.e. ~(p  q)  (~p  ~q) is true ~pq (by commutative law)
pq ( p  q = ~p  q)
when p and q both are false then
Hence pq~q~p
~(p  q) is false and (~p  ~q) is true
i.e. ~(p  q)  (~p  ~q) is false 26. Let p, q, r three statement defined as

Hence ~(p  q)  (~p  ~q) is neither tautology nor p : a number N is divisible by 15

contradiction. q : number N is divisible by 5
r : number N is divisible by 3
10.  p  (q  r) is false Here given statement is p  (q  r)
 p is true and (q  r) is false Here negative of above statement is
 p is true, q and r both are false ~(p (q  r))  p (~(q r)
i.e. p  (q  r) is false when truth values of p, q, r are p (~ q  ~ r)
T, F, F resp. otherwise it is true. i.e. A number is divisible by 15 and it is not divisible by
5 and 3.
11. Let p, q, r be the three statements such that
31. (~ T  F)  ~T  T
p : x = 5, q : y = –2 and r : x – 2y = 9  (F  F)  F  T
Here given statement is (p  q)  r and its contrapositive  FF  T
is ~r  ~(p  q)  F  T
i.e. ~r  (~p  ~q) i.e. if x – 2y  9 then x  5 35.  (~p  ~q)  (p  ~q)
or y  –2  (~p  ~q)  (~q  p) (by commutative law)
 ~p  [~q  (~q  p)] (by Associative law)
12. Let S(p, q)  (p  ~q)  ~p
 ~p  [(~q  ~q)  p] (by Associative law)
 S(~p, ~q)  (~p  q)  p  ~p  (~q  p) ( p  p = p)
Now S*(~p, ~q)  (~p  q)  p  ~p  (p  ~q) (by commutative law)
and ~S(p, q)  ~[(p  ~q)  ~p]  ~(p  ~q)  p  (~p  p)  ~q (by Associative law)
 (~p  q)  p  t  ~q  t t is a tautology
Hence (~p  ~q)  (p  ~q) is a tautology.
Hence S*(~p, ~q)  ~S(p, q)

63
MATHS FOR JEE MAINS & ADVANCED

37.  (p  q)  p is false p q r (p  q)  r

 (p  q) is true and p is false T T T T

T T F F
which is not possible p q (i) (ii) T F T T
T T F T F T T T
so (p  q)  p is always true i.e. it is a tautology.
(iv) T F T T (v) T F F T
F T T T F T F F
39.  [(pp)  q] p (pq)p ( p p  p)
F F T T F F T T
when p is false and q is true (or false) then F F F F

(p  q) is true i.e. (p  q)  p is false

p q r (p  q)  r
Hence [(p  p)  q]  p is not a tautology.
T T T T
T T F F
EXERCISE - 2 T F T T
Part # II : Comprehension F T T T
(vi) T F F F
1. If p then q means p only if q
F T F F
2. If p then q  p is sufficient for q F F T F
3. p is false, q is false so p  q is true. F F F T

4. Fallacy
EXERCISE - 3
Subjective Type 5. Let p be the statement “Traders do not reduce the prices”
and q be the statement “Government takes action against
them”
p q (i) (ii) p q (i) (ii) The first statement in symbolic form is p  q and the
T T T T T T T F second statement is ~(p  ~q).
T F F F T F F F In order to check the equivalence of the above state-
2. (i) (ii)
F T T F F T F F ments let us prepare the following truth table.
F F T F F F T T
p q ~ q p  ~ q ~ (p  ~ q) p  q
T T F F T T
p q r (i) (ii) (iii) (iv) T F T T F F
F T F F T T
T T T T F F F
F F T F T T
T T F F T T F
T F T T F F T Clearly, ~ q  ~p and ~(p  ~q) have same truth values
F T T T T F T for all the values of p and q. Hence, the two
(iii) T F F T F T F statements are equivalent.
F T F F T T F Aliter : We have, ~(p  ~q)  (~p  q)  (p  q)
F F T T T T T Hence the two statements are equivalent.
F F F F T T F
6. True

64
 MATHEMATICAL REASONING

7.
13. p : it rains tomorrow
p q ~p ~q ~q  p p ~p (~q  p) (p ~p)
T T F F F T T
q : I shall carry my umbrella
T F F T T T T r : cloth is mended
F T T F F T T
F F T T F T T P : p  (r  q)
Q : p  ~r
8. Given Statement is
S : ~q
(ABC is right angled at B)  (AB2 + BC2 = AC2)
P : T, Q : T S:T
(A) Its converse is :
 S not valid
(In ABC, AB2 + BC2 = AC2)  ABC is right
angled at B. p q r P Q S
T T T T F F
(B) Its contradiction is : T T F T T F
T F T F F T
(In ABC, AB2 + BC2 = AC2)  ABC is not
T F F T T T
right angled at B. F T T T F F
F T F T F F
(C) Its contrapositive is :
F F T T F T
(In ABC, AB2 + BC2  AC2)  ABC is not F F F T F T

right angled at B. 14. Consider the following statements :

10. The compound statement is : p : Hema is not in team A
“25 is a multiple of 5 or 8” q : Rita is not in team B.
Let us assume that the statement q is false i.e. 25 is r : Mamta is in team A.
not a multiple of 8. Clearly, p is true. We have, S1 : p  ~q, S2 : q  r, S : r  q
Thus, if we assume that q is false, then p is true. In order to test the validity of the given argument,
Hence, the compound statement is true i.e. valid. let us first prepare the truth table for S1  S2  S as
given below.
11. Let q and r be the statements given by
Truth table for S1  S2  S
q : If x is an integer and x2 is even
r : x is an even integer p q r ~q S1 :p~q S2 :qr S1  S2 S:q r S1  S2 S

then p : “If q, then r” T T T F F T F T T

If possible, let r be false then r is false T T F F F F F T T
 x is not an even integer T F T T T T T T T

 x is an odd integer T F F T T T T F F

 x = (2n + 1) for some integer n F T T F T T T T T

 x2 = 4n2 + 4n + 1 F T F F T F F T T

 2
x = 4n(n + 1) + 1 F F T T T T T T T

 x2 is an odd integer F F F T T T T F F

 q is false We observe that the last column of the truth table

[ 4n(n + 1) is even] contains F also. Thus S1 S2  S is not a tautol-
ogy hence argument is invalid.
Thus, r is false  q is false
Hence, p : “If q, then r” is a true statement.

12. (p  q)  [~ p  (p  ~ q)]
= (p  q)  [(~ p  p)  (~ p  ~ q)] = (p  q) 
[t  (~ p  ~ q)] = (p  q)  (~ p  ~ q)
= (p  q)  [ ~ ( p  q)] = t
also (~p  q)  t = t

65
MATHS FOR JEE MAINS & ADVANCED

15. The truth table showing the truth values of hypoth- EXERCISE - 4
eses and conclusion is as given below : Part # I : AIEEE/JEE-MAIN

Hypothes es Conclus ion 1.  p  (q  p) is false

p q r ~q p ~q S1 S2 S3 S  p is true and (q  p) is false. which is not
(p ~q) r p q q p r possible.
T T T F F T T T T  So p  (q  p) is always true i.e. it is a tautology.
T T F F F T T T F  Critical
again p  (p  q) is false
T F T T T T T T T  Rows
T F F T T F T T F p is true and (p  q) is false. Which is not
F T T F F T T F T possible.
F T F F F T T F F So p  (p  q) is always true i.e. it is a tautology.
F F T T F T F T T
F F F T F T F T F Hence p  (q  p)  p  (p  q)

2. Given r : ~p  q
statement-I rqp
We observe that there are three critical rows, namely
statement-II r  (p  ~q)
I, II, & III such that the conclusion is not true in the
IInd row. Hence the given argument is invalid.
p q ~ p ~ q ( ~ p  q) q  p (p  ~ q)
T T F F F T F
T F F T T T T
F T T F T T T
F F T T F F F

Hence Statement-I is false and Statement-II is true.

3. statement-I : ~(p ~q) is equivalent to pq

statement-II : ~(p ~q) is a tautology.

p q ~ q (p  q) (p  ~ q) ~ (p  ~ q)
T T F T F T
T F T F T F
F T F F T F
F F T T F T

Hence statement-1 is true, statement-2 is false.

4. Given S  R and

p = There is a rational number x S such that x > 0

then ~p : Any rational number x S such that x  0
i.e. ~p : Every rational number x S satisfy x  0
5. Given Statement :

66
 MATHEMATICAL REASONING

(p  ~ r)  q
Negations of p  q are
~ (p q), ~ (q p),
~ p q and ~ q p
Hence negations of given statement
are ~(q  (p  ~ r)) and ~ (p  ~ r) q

6. [p  (p  q)]  q
[p  (~p  q)]  q
[(p ~p) (p  q)]  q
[c  (p  q)]  q

p  ~ p  c  contradiction
 (p q)  q 
 c  p p
 ~(p q) q
 (~p ~q) q
 ~p (q ~ q)
 ~p(t)  tautology

9. ~ S (~ r S)

S r ~r ~r S ~ S ~ S  (~ r  S) ~ (~ S  (~ r  S))
T T F F F F T
T F T T F T F
F T F F T T F
F F T F T T F

10. (p~ q) q(~ p q)

= [(p q) (~ q q)] (~ p q)
= [(p q) t](~p q)
= (p q) (~p q)
= [(p q ~p) (p q q)]
= (t q) (p q) = t (p q) = p q

67