Solution
Is the Reason true?
Yes. By the Fundamental Theorem of Arithmetic, the prime factorisation of bc is just the primes of b together with the primes of c. So any prime that appears in bc must have come from b or from c.
For example, 7∣6×14, and indeed 7∣14.
R is true.
Is the Assertion true?
Suppose, to the contrary, that HCF(a,bc)>1. Then a and bc have a common factor bigger than 1, so they have a common prime factor — call it p.
p∣aandp∣bc
By R, since p∣bc:
p∣borp∣c
- If p∣b, then p divides both a and b — but HCF(a,b)=1. Contradiction.
- If p∣c, then p divides both a and c — but HCF(a,c)=1. Contradiction.
Either way we reach a contradiction, so HCF(a,bc)=1. A is true.
A check with numbers. a=5, b=6, c=7: HCF(5,6)=1, HCF(5,7)=1, and HCF(5,42)=1 ✓
Does R explain A?
Yes. The proof of A used R at its central step — without R we could not move from "p divides bc" to "p divides b or c". So R is the correct explanation of A.
(A) Both A and R are true and R is the correct explanation of A