RankRizz
JEE MAIN 2021 · 26 FEB S2+4 / −1MEDIUMTRANSCRIBED

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

Let F1(A,B,C)=(A∧∼B)∨[∼C∧(A∨B)]∨∼AF_1(A, B, C) = (A \wedge \sim B) \vee [\sim C \wedge (A \vee B)] \vee \sim A and F2(A,B)=(A∨B)∨(B→∼A)F_2(A, B) = (A \vee B) \vee (B \to \sim A) be two logical expressions. Then:

SOLUTION

We are given F1(A,B,C)=(A∧∼B)∨[∼C∧(A∨B)]∨∼AF_1(A, B, C) = (A \wedge \sim B) \vee [\sim C \wedge (A \vee B)] \vee \sim A and F2(A,B)=(A∨B)∨(B→∼A)F_2(A, B) = (A \vee B) \vee (B \to \sim A).

First, we check whether F1F_1 is a tautology. Consider A=TA = T, B=TB = T, C=TC = T: (T∧F)∨[F∧(T∨T)]∨F=F∨F∨F=F(T \wedge F) \vee [F \wedge (T \vee T)] \vee F = F \vee F \vee F = F. Since F1F_1 evaluates to FF for this assignment, F1F_1 is not a tautology.

Next, we check F2F_2. Recall that B→∼A≡∼B∨∼AB \to \sim A \equiv \sim B \vee \sim A. So F2=(A∨B)∨(∼B∨∼A)=(A∨∼A)∨(B∨∼B)=T∨T=TF_2 = (A \vee B) \vee (\sim B \vee \sim A) = (A \vee \sim A) \vee (B \vee \sim B) = T \vee T = T.

More explicitly, rearranging: F2=A∨B∨∼B∨∼A=(A∨∼A)∨(B∨∼B)=TF_2 = A \vee B \vee \sim B \vee \sim A = (A \vee \sim A) \vee (B \vee \sim B) = T. So F2F_2 is always true, making it a tautology.

Therefore F1F_1 is not a tautology but F2F_2 is a tautology.

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