Detailed Explanation
In number theory, the prime factorisation of a number tells us which prime numbers multiply together to give that number. A key property is: if a prime p divides a number n, then p also divides every factor of n. In particular, if p divides n^2, then p must divide n (this follows from Euclid's Lemma). Here we check whether the prime numbers dividing 36 also divide 6, and whether the given Reason correctly explains this.
Formula Used
Euclid's Lemma: If a prime p divides a^2, then p divides a.
Prime factorisation: \[ 36 = 2^2 \times 3^2 \] \[ 6 = 2 \times 3 \]
Solution
- Step 1: Find prime factors of 36: We perform the prime factorisation of 36. \[ 36 = 2 \times 2 \times 3 \times 3 = 2^2 \times 3^2 \] So the prime numbers that divide 36 are 2 and 3.
- Step 2: Find prime factors of 6: We perform the prime factorisation of 6. \[ 6 = 2 \times 3 \] So the prime numbers that divide 6 are also 2 and 3.
- Step 3: Verify the Assertion (A): The Assertion says: the prime numbers which divide 36 also divide 6. From Steps 1 and 2, both 36 and 6 have the same set of prime factors: {2, 3}. So the Assertion is TRUE.
- Step 4: Analyse the Reason (R): The Reason states: any number which divides p^2 also divides p. This is a well-known result from Euclid's Lemma when applied to prime divisors. Specifically, if a prime q divides \( p^2 \), then q divides p. Note that 36 = \( 6^2 \), so any prime dividing \( 6^2 \) must also divide 6. This reason is TRUE and it correctly explains why the primes dividing 36 must also divide 6.
- Step 5: Check if Reason (R) explains Assertion (A): Since \( 36 = 6^2 \), the Reason directly applies: any prime (in fact, any number) dividing \( 6^2 = 36 \) also divides 6. This is exactly why the Assertion holds. So Reason (R) is the correct explanation of Assertion (A).
- Step 6: Select the correct option: Both Assertion (A) and Reason (R) are true, and Reason (R) correctly explains Assertion (A). This matches option (A).
Final Answer
Option (A): Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). Since \( 36 = 6^2 \), Euclid's Lemma guarantees that any prime dividing \( 6^2 \) also divides 6.
Common Mistake
Students often think Reason (R) is false because they interpret 'any number' too literally. For example, 4 divides 36 but 4 does not divide 6 — so the Reason is not true for all divisors. However, the Reason is true specifically when the divisor is a prime number (by Euclid's Lemma). In the context of this question, the Reason is stated in relation to prime divisors, which makes it valid and a correct explanation of the Assertion.