RankRizz
JEE MAIN 2019 · 10 APR S1+4 / −1EASYTRANSCRIBED

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

Which one of the following Boolean expression is a tautology?

SOLUTION

First, remember that a Boolean expression is called a tautology if it is always true, no matter whether the simple propositions pp and qq are true (T) or false (F). To decide which option is a tautology, we shall simplify every given expression algebraically, employing these standard Boolean laws:

(1) Distributive law:  a∧(b∨c)=(a∧b)∨(a∧c),(2) Distributive law:  a∨(b∧c)=(a∨b)∧(a∨c),(3) Complement law:  a∨¬a=T,  a∧¬a=F,(4) Identity law:  a∨F=a,  a∧T=a,(5) Domination law:  a∨T=T,  a∧F=F.\begin{aligned} &\text{(1) Distributive law:}&\; a\wedge(b\vee c)= (a\wedge b)\vee(a\wedge c),\\ &\text{(2) Distributive law:}&\; a\vee(b\wedge c)= (a\vee b)\wedge(a\vee c),\\ &\text{(3) Complement law:}&\; a\vee\neg a = \text{T},\; a\wedge\neg a = \text{F},\\ &\text{(4) Identity law:}&\; a\vee\text{F}=a,\; a\wedge\text{T}=a,\\ &\text{(5) Domination law:}&\; a\vee\text{T}=\text{T},\; a\wedge\text{F}= \text{F}. \end{aligned}

Now we analyse each option one by one.

Option A: (p∨q)∧(¬p∨¬q)(p \vee q)\wedge (\neg p \vee \neg q)

We notice that ¬p∨¬q\neg p\vee\neg q is the negation of p∧qp\wedge q by De Morgan’s law, so we may write

(p∨q)∧¬(p∧q).(p\vee q)\wedge\neg(p\wedge q).

This is exactly the exclusive-or (“one but not both”) condition. For example, if both pp and qq are true, then p∧qp\wedge q is true, its negation is false, and the whole expression becomes false. Hence Option A is not always true, so it is not a tautology.

Option B: (p∧q)∨(p∧¬q)(p\wedge q)\vee(p\wedge\neg q)

We factor out the common literal pp using the distributive law (1):

(p∧q)∨(p∧¬q)=p∧(q∨¬q).(p\wedge q)\vee(p\wedge\neg q)= p\wedge (q\vee\neg q).

By the complement law (3), q∨¬q=Tq\vee\neg q=\text{T}, so

p∧T=p.p\wedge \text{T}=p.

Since pp can be true or false, the whole expression can also be true or false; therefore it is not a tautology.

Option C: (p∨q)∧(p∨¬q)(p\vee q)\wedge(p\vee\neg q)

Here we use the distributive law (2) in reverse, pulling out the common literal p∨p\vee:

(p∨q)∧(p∨¬q)=p∨(q∧¬q).(p\vee q)\wedge(p\vee\neg q)= p\vee(q\wedge\neg q).

Again by the complement law (3), q∧¬q=Fq\wedge\neg q=\text{F}, so we get

p∨F=p.p\vee \text{F}=p.

This reduces to the single variable pp, which is not always true, so Option C is also not a tautology.

Option D: (p∨q)∨(¬p∨¬q)(p \vee q)\vee(\neg p \vee \neg q)

Using associativity and commutativity of ∨\vee, we simply collect all the literals:

(p∨q)∨(¬p∨¬q)=p∨¬p∨q∨¬q.(p\vee q)\vee(\neg p\vee \neg q)= p\vee\neg p\vee q\vee\neg q.

Now group the complementary pairs:

p∨¬p=T,q∨¬q=T.p\vee\neg p = \text{T}, \quad q\vee\neg q = \text{T}.

So the entire expression becomes

T∨T=T,\text{T}\vee\text{T}=\text{T},

which is true for every possible truth‐value combination of pp and qq. Therefore Option D is a tautology.

After examining all four choices, we see that only Option 4 (that is, Option D) is always true.

Hence, the correct answer is Option 4.

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