RankRizz
JEE MAIN 2019 · 10 JAN S2+4 / −1EASYTRANSCRIBED

JEE Main 2019 Mathematics question — Implications, negation and quantifiers

Consider the following three statements:
P: 5 is a prime number
Q: 7 is a factor of 192
R: LCM of 5 and 7 is 35
Then the truth value of which one of the following statements is true?

SOLUTION

First, we list the three simple statements exactly as given and decide whether each one is true or false.

P:  5 is a prime numberP : \; 5 \text{ is a prime number} Because a prime number has exactly two distinct positive divisors, namely 1 and itself, and 55 satisfies this definition, we have P=True.P = \text{True}.

Q:  7 is a factor of 192Q : \; 7 \text{ is a factor of } 192 A number aa is a factor of bb if and only if b÷ab \div a is an integer. Computing 1927=27.428571…\dfrac{192}{7}=27.428571\ldots which is not an integer, so 77 is not a factor of 192192. Hence Q=False.Q = \text{False}.

R:  LCM of 5 and 7 is 35R : \; \text{LCM of } 5 \text{ and } 7 \text{ is } 35 Since 55 and 77 are coprime, their least common multiple equals their product, i.e. LCM(5,7)=5×7=35.\text{LCM}(5,7)=5 \times 7 = 35. Therefore R=True.R = \text{True}.

Next, we evaluate each compound statement in the options by substituting these truth values and applying the standard logical rules.

Option A: P∨(∼Q∧R)P \vee (\sim Q \wedge R) First find each component: ∼Q=not False=True,\sim Q = \text{not False} = \text{True}, so ∼Q∧R=True∧True=True.\sim Q \wedge R = \text{True} \wedge \text{True} = \text{True}. Now use the value of PP together with the disjunction rule: P∨(∼Q∧R)=True∨True=True.P \vee (\sim Q \wedge R) = \text{True} \vee \text{True} = \text{True}.

Option B: (P∧Q)∨(∼R)(P \wedge Q) \vee (\sim R) Compute the conjunction P∧QP \wedge Q: P∧Q=True∧False=False.P \wedge Q = \text{True} \wedge \text{False} = \text{False}. Next negate RR: ∼R=not True=False.\sim R = \text{not True} = \text{False}. Finally take their disjunction: (P∧Q)∨(∼R)=False∨False=False.(P \wedge Q) \vee (\sim R) = \text{False} \vee \text{False} = \text{False}.

Option C: (∼P)∨(Q∧R)(\sim P) \vee (Q \wedge R) Negate PP: ∼P=not True=False.\sim P = \text{not True} = \text{False}. Find Q∧RQ \wedge R: Q∧R=False∧True=False.Q \wedge R = \text{False} \wedge \text{True} = \text{False}. Now the disjunction: (∼P)∨(Q∧R)=False∨False=False.(\sim P) \vee (Q \wedge R) = \text{False} \vee \text{False} = \text{False}.

Option D: (∼P)∧(∼Q∧R)(\sim P) \wedge (\sim Q \wedge R) From above, ∼P=False\sim P = \text{False} and ∼Q∧R=True\sim Q \wedge R = \text{True}. Therefore the conjunction gives (∼P)∧(∼Q∧R)=False∧True=False.(\sim P) \wedge (\sim Q \wedge R) = \text{False} \wedge \text{True} = \text{False}.

Summarizing the evaluations:

Option A=True,Option B=False,Option C=False,Option D=False.\text{Option A} = \text{True}, \quad \text{Option B} = \text{False}, \quad \text{Option C} = \text{False}, \quad \text{Option D} = \text{False}.

Only Option A yields the truth value “True”.

Hence, the correct answer is Option A.

Tagged Implications, negation and quantifiers. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicImplications, negation and quantifiers
TypeMultiple choice