RankRizz
JEE MAIN 2016 · 03 APR OFFLINE+4 / −1EASYTRANSCRIBED

JEE Main 2016 Mathematics question — Logical connectives, truth tables and tautologies

The Boolean Expression (p∧∼q)∨q∨(∼p∧q)(p \wedge \sim q) \vee q \vee (\sim p \wedge q) is equivalent to

SOLUTION

We have to simplify the Boolean expression E=(p∧∼q)  ∨  q  ∨  (∼p∧q)E=(p \wedge \sim q)\; \vee\; q\; \vee\; (\sim p \wedge q) and compare the result with the four alternatives.

Because the ∨\vee (OR) and ∧\wedge (AND) operations are both commutative and associative, we may rearrange the terms without changing the value. Thus we write

E  =  q  ∨  (p∧∼q)  ∨  (∼p∧q).E \;=\; q \;\vee\; (p \wedge \sim q) \;\vee\; (\sim p \wedge q).

Now notice the presence of the term qq by itself and the compound term (∼p∧q).(\sim p \wedge q). The absorption law of Boolean algebra states that

x  ∨  (y∧x)  =  x.x \;\vee\; (y \wedge x) \;=\; x.

Here, let us set x=qx = q and y=∼p.y = \sim p. Applying the absorption law, we obtain

q  ∨  (∼p∧q)=q.q \;\vee\; (\sim p \wedge q) = q.

Substituting this result back into the full expression gives

E  =  q  ∨  (p∧∼q).E \;=\; q \;\vee\; (p \wedge \sim q).

At this stage, only two terms remain. To proceed further we invoke the distributive law, which in Boolean form states

a  ∨  (b∧c)  =  (a∨b)  ∧  (a∨c).a \;\vee\; (b \wedge c) \;=\; (a \vee b) \;\wedge\; (a \vee c).

Assigning a=q,  b=p,  c=∼q,a = q,\; b = p,\; c = \sim q, we have

q  ∨  (p∧∼q)  =  (q∨p)  ∧  (q∨∼q).q \;\vee\; (p \wedge \sim q)\;=\;(q \vee p)\;\wedge\;(q \vee \sim q).

The expression (q∨∼q)(q \vee \sim q) is always true (a tautology), because either qq is true or ∼q\sim q is true. In Boolean algebra, a tautology is represented by 11. Therefore,

(q∨p)  ∧  1  =  q∨p.(q \vee p)\;\wedge\;1 \;=\; q \vee p.

Since the OR operation is commutative, q∨p=p∨q.q \vee p = p \vee q. Hence the completely simplified form of the original expression is

E=p∨q.E = p \vee q.

Looking at the options provided, this matches Option A.

Hence, the correct answer is Option A.

Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicLogical connectives, truth tables and tautologies
TypeMultiple choice