RankRizz
JEE MAIN 2023 · 01 FEB S1+4 / −1EASYTRANSCRIBED

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

The negation of the expression q∨((∼q)∧p)q \vee ((\sim q) \wedge p) is equivalent to

SOLUTION

We need to find the negation of q∨((∼q)∧p)q \vee ((\sim q) \wedge p).

First, let us simplify the expression using the distributive law:

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

Since q∨∼q=Tq \vee \sim q = T (tautology):

q∨((∼q)∧p)=T∧(q∨p)=q∨pq \vee ((\sim q) \wedge p) = T \wedge (q \vee p) = q \vee p

Now, the negation is:

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

This follows from De Morgan's law: ∼(A∨B)=(∼A)∧(∼B)\sim(A \vee B) = (\sim A) \wedge (\sim B).

Therefore, the negation is (∼p)∧(∼q)(\sim p) \wedge (\sim q).

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