For integers and , both greater than 1, consider the following three statements : P : m divides n Q : m divides R : m is prime, then
We are given three statements for integers and , both greater than 1:
We need to evaluate the logical implications given in the options and determine which one is always true.
Starting with Option A: . This means if Q and R are both true, then P must be true. That is, if divides and is prime, then divides .
Assume Q and R are true: and is prime. Since is prime and divides , and , by Euclid's lemma (which states that if a prime divides a product, it must divide at least one factor), must divide . Therefore, P is true. This implication holds.
Now, Option B: . This means if P and Q are true, then R must be true. That is, if divides and divides , then is prime.
Note that if P is true (), then Q () is automatically true because if for some integer , then , so . Thus, the premise reduces to P being true. But the conclusion requires to be prime, which may not hold. For example, let (composite) and . Then P: is true (since ), and Q: is true (since ), but R: is not prime. Since the premise is true and the conclusion is false, this implication is not always true.
Option C: . This means if Q is true, then R must be true. That is, if divides , then is prime.
This is not always true. For example, let and . Then Q: is true (since ), but R: is not prime. Thus, this implication is false.
Option D: . This means if Q is true, then P must be true. That is, if divides , then divides .
This is not always true. For example, let and . Then Q: is true, but P: is false (since , not an integer). Another example: and . Then Q: is true (since ), but P: 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.