MATHEMATICAL REASONING

MATHEMATICAL REASONING
1. The number of choices of   {,  , , }, such that (d) ( p  q)  ( ( p  q))
( p  q)  (( p  q)  (( p) q)) is a tautology, is 9. Let p, q, r be three logical statements. Consider the
(a) 1 (b) 2 compound statements
(c) 3 (d) 4 S1 : (( p )  q )  (( p )  r ) and
2. Consider the following statements : S 2 : p  (q  r )
(A) : Rishi is a judge.
Then, which of the following is NOT true ?
(B) : Rishi is honest.
(a) If S 2 is True, then S1 is True
(C) : Rishi is not arrogant.
The negation of the statement “if Rishi is a judge and (b) If S 2 is False, then S1 is False
he is not arrogant, then he is honest” is (c) If S 2 is False, then S1 is True
(a) B  ( A  C ) (b) ( B)  ( A  C ) (d) If S1 is False, then S2 is False
(c) B  (( A)  ( C )) (d) B  ( A  C ) 10. Let  {,  , ,  ) be such that
3. Consider the following two propositions : ( p  q)  ( p  q)  q) is a tautology. Then  is equal
P1: ( p  q )
to:
P2 : ( p  q )  (( p )  q ) (a)  (b) 
If the proposition p  (( p )  q ) is evaluated as (c)  (d) 
FALSE, then : 11. Negation of the Boolean statement
(a) P1 is TRUE and P2 is FALSE ( p  q)  (( r )  p) is equivalent to :
(b) P1 is FALSE and P2 is TRUE (a) p  ( q )  r (b) ( p)  ( q)  r
(c) Both P1 and P2 are FALSE
(c) ( p)  q  r (d) p  q  ( r )
(d) Both P1 and P2 are TRUE
12. Which of the following statements is a tautology ?
4. The negation of the Boolean expression
(( q)  p)  (( p)  q) is logically equivalent to (a) (( p) v q)  p (b) p  (( p ) v q )

(a) p  q (b) q  p (c) (( p) v q)  q (d) q  (( p ) v q )

( p  q) (q  p)
13. Consider the following statements :
(c) (d)
P : Ramu is intelligent
5. Let ,   {, } be such that p  q  (( pq )r ) is Q : Ramu is rich
a tautology. Then ( pq) r is logically equivalent to : R : Ramu is not hones
(a) ( p  r )  q (b) ( p  r )  q The negation of the statement “Ramu is intelligent and
honest if and only if Ramu is not rich” can be
(c) ( p  r ) q (d) ( p  r )  q
expressed as :
6. Let r  { p, q, p, q} be such that the logical (a) (( P  ( R))  Q)  (( Q)  (( P)  R))
statement r  ( p )  ( p  q)  r is a tautology. Then (b) (( P  R))  Q)  (( Q)  (( P)  ( R)))
'r' is equal to :
(c) (( P  R))  Q)  (( Q)  (( P)  ( R)))
(a) p (b) q
(d) (( P  ( R))  Q)  (( Q)  (( P)  R))
(c) p (d) q
14. The statement ( ( p  q))  q is :
7. The Boolean expression ( ( p  q))  q is equivalent
(a) a tautology
to :
(b) a contradiction
(a) q  ( p  q ) (b) p  q
(c) equivalent to ( p  q)  q
(c) p  ( p  q ) (d) p  ( p  q )
(d) equivalent to ( p  q)  p
8. Which of the following statement is a tautology ?
15. Negation of the Boolean expression p  ( q  p) is
(a) (( q)  p)  q
(a) ( p )  q (b) p  ( q )
(b) (( q)  p)  ( q  ( p))
(c) ( p)  ( q) (d) ( p)  ( q)
(c) ( p  q)  ( p  q)
 MATHEMATICAL REASONING

16. ( p  r )  ( p  ( q)) is equivalent to ( p) when r

is
(a) p (b) p
(c) q (d) q
17. If the truth value of the statement
( P  ( R))  (( R)  Q) is F, then the truth value of
which of the following is F ?
(a) P  Q  R (b) R  Q  P
(c) ( P  Q)  R (d) ( R  Q)  P
18. Let the operations *,  {, }. If
( p * q) (p q) is a tautology, then the ordered
pair (*, ) is :
(a) ( ,  ) (b) ( ,  )
(c) ( ,  ) (d) ( ,  )
19. Let
p : Ramesh listens to music.
q : Ramesh is out of his village
r : It is Sunday
s : It is Saturday
Then the statement “Ramesh listens to music only if he
is in his village and it is Sunday or Saturday” can be
expressed as
(a) (( q)  ( r  s))  p
(b) ( p  ( r  s)  p
(c) p  (q  (r  s ))
(d) p  (( q )  (r  s ))
20. The statement ( p  q)  ( p  r ) is equivalent to :
(a) q  ( p  r )
(b) p  ( p  r )
(c) ( p  r )  ( p  q)
(d) ( p  q)  r
21. The statement ( p  q)  ( p  r ) is NOT equivalent
to :
(a) ( p  ( r ))  q (b) ( q)  (( r )  p)
(c) p  (q  r ) (d) ( p  ( q))  r
22. The maximum number of compound propositions, out
of
p  r  s, p  r  s, p  q  s,
p r  s, p r s, p q s,
qr s, q  r s, p q s
that can be made simultaneously true by an assignment
of the truth values to p, q, r and s , is equal to
MATHEMATICAL REASONING

Answer Key
1. (b) 2. (b) 3. (c) 4. (c) 5. (a) 6. (c) 7. (d) 8. (c) 9. (c)
10. (c) 11. (c) 12. (d) 13. (d) 14. (d) 15. (d) 16. (c) 17. (d) 18. (b)
19. (d) 20. (d) 21. (b) 22. 9.00

Solutions
1. For tautology (( p  q)  (( p) q)) must be true.
This is possible only when    & 
2. (( A  C )  B)
( ( A  C )  B)
Using De-Morgan's law
( A  C )  ( B)
Option (b) is correct.
3.
p q p q pq p  ( p  q) p q (p  q) p q p2
T T F F T T F T F F
T F F T F F T F T F
F T T F T T T F F F
F F T T T T T F F F
p  ( p  q ) is F when p is true q is false
From table
P1 & P2 both are false.
4. pq  p  q
q p  ( p  q)
Negation of ( p  q)  ( p  q)
is ( p  q)  ( ( p  q)) ( p  q)
5. Case-I: If     
( p  q)  (( p  q)  r )
it can be false if r is false,
so not a tautology
Case-II: If     
( p  q)  (( p  q)  r )  tautology
then ( p  q)  r  ( p r )  q
Case-III: If   ,   
then, ( p  q)  {( p  q)  r}
Not a tautology
(check p  T , q  T , r  F )
Check –IV   ,   
( p  q)  {( p  q)  r}
Not a tautology
 MATHEMATICAL REASONING

(Check p  T , q  T , r  F )
Case-IV: If   ,   
( p  q)  {( p  q)  r}
Not a tautology
6. By Options
(1)
pr q p r  ( p) ( p  q) ( p  q)  r r  ( p)  ( p  q)  r
T F F T F T T
F T T T F F F
T T F T T T T
F F T T F F T
(2)
p p r  ( p) qr ( p  q) ( p  q)  r r  ( p)  ( p  q)  r
T F T T T T T
F T T T F T T
T F F F F F T
F T T F F F F
(3)
p q r  ( p) r  ( p) ( p  q) ( p  q)  r r  ( p)  ( p  q)  r
T T F F T T T
F T T T F T T
T F F F F F T
F F T T F T T
(4)
p p q r  ( p) ( p  q) ( p  q) ( p  q)  r r  ( p)  ( p  q)  r
F T T F F T T T
F T F T T F T T
T F T T F F F F
T F F T T F T T
Now final answer is option no. 3.
7. ( ( p  q))  q
 ( p  q)  q
 p qq
 pt
= this statement is a tautology option (d)
p  ( p  q ) is also a tautology.
OR
p q pq ( p  q) ( p  q)  q p q p  ( p  q)
T T T F T T T
T F F T T T T
F T F T T T T
F F F T T F T

8. (a) ( q  p)  q  ( q  q)  p  f
(b) ( q  p)  ( p  p)  q  ( p  p)  f
(c) ( p  q)  ( p  q )  ( q  p )  (t )  t
MATHEMATICAL REASONING

(d) ( p  q)  ( p  q))  f
9. s1 : ( p  q )  ( p  r )
 p  (q  r )
s2 : p  ( q  r )
 p  (q  r )  By conditional law
s1  s2
10. pq  q
 ( p  q)  q
 ( p q)  q
 ( p  q)  ( q  q)
 ( p  q)  t  p q
Now by taking option C
( p  q)  p  q
 p q p  q
t
Hence (c)
11. p  q  ( r  p)
 ( p  q)  ( r  p)
( p q)  ( p  r)
 [ p  p)  ( q  p)]  r
 [ q  p)  r
Its negation is p pr
12.

p q p q pvq
T T F F T
T F F T F
F T T F T
F F T T T
options 1 2 3 4
T T T T
T F T T
F T T T
F T F T

13. (( P  ( R))  Q)  (( Q)  (( P)  R))

14. ( (p  q))  q  ( p  q)  q
( p  q)  q  p  q

15. ( p  (q  p))
 MATHEMATICAL REASONING

( p  q)  ( p  q)  (q  p)
( p  ( q  p))  ( p  ( q  p))  (( q  p)  p)
( p ( q  p))  p  ( q  p)  ( p  p)  q  c
(q  p) p  ( q  p) p p  ( q  p)
 ( p q)  ( p  p)  p q
( p  ( q  p))  c  ( p  q)  p q
16. Given ( p  r )  ( p  ( q))  ( p)
Taking r  q
p q p q p q p q ( p  r )  ( p  ( q))
T T F F T F F
T F F T F T F
F T T F F F T
F F T T F F T
So, clear ( p  r )  ( p  ( q))  ( p)

17. X  Y is a false
when X is true and Y is false
So, P  T , Q  F , R  F
(a) P  Q  R is T
(b) R  Q  P is T
(c) ( P  Q)  R is T
(d) ( R  Q)  P is F

18. Check each option

For A *   and  
( p  q)  ( p  q)
 p  (q  q)
 p  (c )  p
For B : *  , 
( p  q)  ( p  q)  t using Venn Diagrams

19. p  Ramesh listens to music

q  He is in village.
r  s  Saturday or sunday
p  (( q )  (r  s ))
20. ( p  q)  ( p  r )
( p  q)  ( p  r )
( p q)  ( p  r )
( p  ( p  r ))  q
MATHEMATICAL REASONING

( p  p)  ( p  r )  q
( p  r)  q
( p q)  r
( p  q)  r
( p  q)  r
21. ( p  q)  ( p  r )
( p  q)  ( p  r )
 p  (q  r )
 p  (q  r )  (3) is true.
Now (1) ( p  r)  q
(p  r)  q  ( p  r)  q
 p  (r  q )  p  (q  r )
(4) ( p  q)  r  p  ( q  r )
22. If we take

p q r s
F F T F
The truth value of all the propositions will be true.