RankRizz
JEE MAIN 2013 · 25 APR ONLINE+4 / −1EASYTRANSCRIBED

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

Let pp and qq be any two logical statements and r:p→(∼p∨q)r : p \rightarrow (\sim p \vee q). If rr has a truth value FF, then the truth values of pp and qq are respectively:

SOLUTION

We are given that r:p→(∼p∨q)r: p \rightarrow (\sim p \vee q) has a truth value of false (F). We need to find the truth values of pp and qq that make rr false.

Recall that an implication a→ba \rightarrow b is false only when aa is true and bb is false. For rr to be false, we must have:

  • pp is true (T), and
  • ∼p∨q\sim p \vee q is false (F).

Now, a disjunction (OR) like ∼p∨q\sim p \vee q is false only when both components are false. Therefore:

  • ∼p\sim p must be false (F), and
  • qq must be false (F).

If ∼p\sim p is false, then pp must be true (T), because the negation of true is false and vice versa. This matches the first condition that pp is true.

Thus, we have:

  • p=Tp = \text{T}
  • q=Fq = \text{F}

Let us verify these truth values by substituting them into rr.

If pp is true (T), then ∼p\sim p is false (F).

Now, ∼p∨q=F∨F=F\sim p \vee q = \text{F} \vee \text{F} = \text{F} (since both are false).

Then, r:p→(∼p∨q)=T→Fr: p \rightarrow (\sim p \vee q) = \text{T} \rightarrow \text{F}.

We know that true implies false is false (T →\rightarrow F = F), which matches the given condition that rr is false.

Therefore, the truth values of pp and qq are true (T) and false (F) respectively.

Looking at the options:

  • A. F, F
  • B. T, T
  • C. T, F
  • D. F, T

Option C matches T, F.

Hence, the correct answer is Option C.

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