RankRizz
JEE MAIN 2013 · 23 APR ONLINE+4 / −1MEDIUMTRANSCRIBED

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

For integers mm and nn, both greater than 1, consider the following three statements : P : m divides n Q : m divides n2n^2 R : m is prime, then

SOLUTION

We are given three statements for integers mm and nn, both greater than 1:

  • P: mm divides nn (i.e., nn is divisible by mm, written as m∣nm \mid n)
  • Q: mm divides n2n^2 (i.e., m∣n2m \mid n^2)
  • R: mm is prime

We need to evaluate the logical implications given in the options and determine which one is always true.

Starting with Option A: Q∧R→PQ \wedge R \rightarrow P. This means if Q and R are both true, then P must be true. That is, if mm divides n2n^2 and mm is prime, then mm divides nn.

Assume Q and R are true: m∣n2m \mid n^2 and mm is prime. Since mm is prime and divides n2n^2, and n2=n×nn^2 = n \times n, by Euclid's lemma (which states that if a prime divides a product, it must divide at least one factor), mm must divide nn. Therefore, P is true. This implication holds.

Now, Option B: P∧Q→RP \wedge Q \rightarrow R. This means if P and Q are true, then R must be true. That is, if mm divides nn and mm divides n2n^2, then mm is prime.

Note that if P is true (m∣nm \mid n), then Q (m∣n2m \mid n^2) is automatically true because if n=m⋅kn = m \cdot k for some integer kk, then n2=m⋅(m⋅k2)n^2 = m \cdot (m \cdot k^2), so m∣n2m \mid n^2. Thus, the premise P∧QP \wedge Q reduces to P being true. But the conclusion requires mm to be prime, which may not hold. For example, let m=4m = 4 (composite) and n=4n = 4. Then P: 4∣44 \mid 4 is true (since 4=4×14 = 4 \times 1), and Q: 4∣164 \mid 16 is true (since 16=4×416 = 4 \times 4), but R: m=4m = 4 is not prime. Since the premise is true and the conclusion is false, this implication is not always true.

Option C: Q→RQ \rightarrow R. This means if Q is true, then R must be true. That is, if mm divides n2n^2, then mm is prime.

This is not always true. For example, let m=4m = 4 and n=2n = 2. Then Q: 4∣22=44 \mid 2^2 = 4 is true (since 4=4×14 = 4 \times 1), but R: m=4m = 4 is not prime. Thus, this implication is false.

Option D: Q→PQ \rightarrow P. This means if Q is true, then P must be true. That is, if mm divides n2n^2, then mm divides nn.

This is not always true. For example, let m=4m = 4 and n=2n = 2. Then Q: 4∣22=44 \mid 2^2 = 4 is true, but P: 4∣24 \mid 2 is false (since 2÷4=0.52 \div 4 = 0.5, not an integer). Another example: m=9m = 9 and n=3n = 3. Then Q: 9∣32=99 \mid 3^2 = 9 is true (since 9=9×19 = 9 \times 1), but P: 9∣39 \mid 3 is false. Hence, this implication is false.

Only Option A is always true. Therefore, the correct answer is Option A.

Hence, the correct answer is Option A.

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