SOLVER7 Study. Nothing Else.
2026 Board Paper Q19

Assertion (A) : The prime numbers which divide 36 also divide 6. Reason (R) : Any number which divides \(p^2\) also divides \(p\). Select the correct answer to these questions from the codes (A), (B), (C) and (D) as given below.
(A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

CBSE Class 10 Maths · Real Numbers

Solution

👶 Simple Explanation

Simple Explanation

Think of 36 as a family made by multiplying 6 by itself. The building blocks of 36 are 2 and 3, because \( 36 = 2 \times 2 \times 3 \times 3 \). Those same building blocks make up 6, since \( 6 = 2 \times 3 \). It is like saying: if small coloured bricks build a big tower, those same bricks also built the smaller tower inside it. So yes, every prime that fits into 36 also fits into 6, and the rule about squares explains exactly why.

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.

📖 Assertion-Reason: Prime Factors of 36 and 6

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

  1. 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.
  2. 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.
  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.
  4. 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.
  5. 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).
  6. 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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Find the prime factorisation of 36 by dividing repeatedly by the smallest prime: \[ 36 = 2 \times 18 = 2 \times 2 \times 9 = 2^2 \times 3^2 \] So the primes dividing 36 are 2 and 3. — Reason: Prime factorisation reveals every prime that divides the number.
  2. Step 2: Find the prime factorisation of 6: \[ 6 = 2 \times 3 \] So the primes dividing 6 are also 2 and 3. — Reason: We need to compare the prime factors of 36 with those of 6 to check the Assertion.
  3. Step 3: Check Assertion (A): The Assertion claims that every prime dividing 36 also divides 6. From Steps 1 and 2, both numbers share exactly the same set of prime factors, namely \( \{2, 3\} \). Therefore, Assertion (A) is TRUE. — Reason: A statement is verified by directly comparing results from factorisation.
  4. Step 4: Observe the key relationship between 36 and 6: \[ 36 = 6^2 \] This means 36 is the perfect square of 6. — Reason: Recognising this relationship lets us apply Euclid's Lemma directly.
  5. Step 5: Apply Euclid's Lemma to the Reason (R): The Reason states that any prime dividing \( p^2 \) must also divide \( p \). Since \( 36 = 6^2 \), any prime \( q \) that divides \( 6^2 \) must divide 6. This is exactly what Euclid's Lemma guarantees, so Reason (R) is TRUE. — Reason: Euclid's Lemma is a proven theorem in number theory that applies whenever a prime divides a perfect square.
  6. Step 6: Decide whether Reason (R) correctly explains Assertion (A): The Reason directly justifies why every prime dividing \( 36 = 6^2 \) must divide 6, which is precisely what the Assertion states. Hence, Reason (R) is not only true but is also the correct explanation for Assertion (A). — Reason: A reason correctly explains an assertion when its logical content directly causes or proves the assertion.

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

One common mistake: Students sometimes think the Reason is true but does not explain the Assertion — they must notice that \( 36 = 6^2 \), which makes Euclid's Lemma apply directly and serve as the exact justification for the Assertion.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Prime factorisations: \[ 36 = 2^2 \times 3^2 \] \[ 6 = 2 \times 3 \]
  2. Step 2: Primes dividing 36: \( \{2, 3\} \); primes dividing 6: \( \{2, 3\} \). Assertion (A) is TRUE.
  3. Step 3: Since \( 36 = 6^2 \), by Euclid's Lemma any prime dividing \( 6^2 \) also divides 6. Reason (R) is TRUE and correctly explains (A).

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.

➕ More Examples

More Examples

Example 1

Question: Assertion (A): The prime numbers that divide 100 also divide 10. Reason (R): If a prime number divides \( n^2 \), then it must also divide \( n \). Select the correct answer from the codes below. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution: Step 1 — Check Assertion (A). Find the prime factorisation of 100 and 10. \[100 = 2^2 \times 5^2\] \[10 = 2 \times 5\] The prime factors of 100 are 2 and 5. The prime factors of 10 are also 2 and 5. So every prime that divides 100 also divides 10. Assertion (A) is TRUE. Step 2 — Check Reason (R). The statement is: if a prime \( p \) divides \( n^2 \), then \( p \) divides \( n \). This is a standard result from number theory. Since \( p \) is prime and \( p \mid n^2 = n \times n \), by Euclid's lemma \( p \mid n \). Reason (R) is TRUE. Step 3 — Does R explain A? Here \( 100 = 10^2 \), so 100 is the square of 10. By Reason (R), any prime dividing \( 10^2 \) must divide 10. This directly explains why every prime factor of 100 also divides 10. So R is the correct explanation of A. The answer is (A).

Answer: (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).

Example 2

Question: Assertion (A): The prime numbers that divide 225 also divide 15. Reason (R): Any number (not necessarily prime) that divides \( p^2 \) also divides \( p \). Select the correct answer from the codes below. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution: Step 1 — Check Assertion (A). Find the prime factorisation of 225 and 15. \[225 = 15^2 = 3^2 \times 5^2\] \[15 = 3 \times 5\] The prime factors of 225 are 3 and 5. The prime factors of 15 are also 3 and 5. So every prime that divides 225 also divides 15. Assertion (A) is TRUE. Step 2 — Check Reason (R). The Reason claims that ANY number dividing \( p^2 \) must divide \( p \). This is FALSE in general. Consider \( p = 12 \): \[p^2 = 144\] The number 4 divides 144 (since \( 144 = 4 \times 36 \)), but 4 does not divide 12? Actually \( 12 \div 4 = 3 \), so 4 does divide 12. Let us try \( p = 6 \): \[p^2 = 36\] The number 4 divides 36 (since \( 36 = 4 \times 9 \)), but 4 does not divide 6. So 4 divides \( 6^2 \) but 4 does not divide 6. This is a counterexample showing that non-prime divisors of \( p^2 \) need not divide \( p \). Reason (R) is FALSE. Step 3 — Combine. Assertion (A) is true but Reason (R) is false. The answer is (C).

Answer: (C) Assertion (A) is true, but Reason (R) is false.

🎯 Try a Similar Question

Try a Similar Question

Question: Assertion (A): The prime numbers that divide 100 also divide 10.
Reason (R): Any prime number that divides \( n^2 \) must also divide \( n \).
Select the correct answer from the options below. (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution

  1. Step 1: Verify the Assertion: Find the prime factorisation of 100 and 10. We have \( 100 = 2^2 \times 5^2 \) and \( 10 = 2 \times 5 \). The prime factors of 100 are 2 and 5. The prime factors of 10 are also 2 and 5. So every prime that divides 100 also divides 10. The Assertion is TRUE.
  2. Step 2: Verify the Reason: The Reason states: any prime number that divides \( n^2 \) must also divide \( n \). This is a direct consequence of Euclid's Lemma. If a prime \( p \) divides \( n^2 = n \times n \), then \( p \) divides \( n \). The Reason is TRUE.
  3. Step 3: Check whether the Reason explains the Assertion: Notice that \( 100 = 10^2 \). So the Assertion is precisely the case \( n = 10 \) in the Reason: every prime dividing \( 10^2 \) (which equals 100) must divide 10. The Reason directly and correctly explains why the Assertion holds.
  4. Step 4: Compare with Option (C): Option (C) would require the Reason to be false, but we established the Reason is a true and valid statement (Euclid's Lemma). So Option (C) is incorrect. The correct choice is Option (A).

Answer: Option (A): Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). Since \( 100 = 10^2 \), by Euclid's Lemma any prime dividing \( 10^2 \) must also divide 10, directly explaining the Assertion.

Everything you get with Solver7

More questions in Real Numbers

Chapter 1 - Theorem Q1 30/4/1 2023 / Section A Q1 430/1/1 2026 / Section A Q1 430/2/1 2026 / Section A Q1 430/3/1 2026 / Section A Q1 430/4/1 2026 / Section A Q1 430/5/1 2024 / Section A Q1 Chapter 1 - Theorem Q2 30/3/1 2026 / Section A Q2 430/1/1 2026 / Section A Q2 430/2/1 2026 / Section A Q2 430/3/1 2026 / Section A Q2 CBSE-ADDL1 2024 / Section A Q2 Chapter 1 - Theorem Q3 430/3/1 2026 / Section A Q3 Chapter 1 - Examples Q1 30/2/1 2023 / Section A Q4 30/2/1 2026 / Section A Q4 Chapter 1 - Examples Q2 Chapter 1 - Examples Q3 30/1/1 2026 / Section A Q6 430/5/1 2023 / Section A Q6 Chapter 1 - Examples Q4 430/2/1 2023 / Section A Q7 430/5/1 2024 / Section A Q7 Chapter 1 - Examples Q5 430/5/1 2024 / Section A Q8 Chapter 1 - Examples Q6 30/1/1 2026 / Section A Q9 Chapter 1 - Examples Q7 30/2/1 2026 / Section A Q10 Exercise 1.1 Q1 (i) Exercise 1.1 Q1 (ii) Exercise 1.1 Q1 (iii) 430/4/1 2024 / Section A Q13 Exercise 1.1 Q1 (iv) 30/1/1 2026 / Section A Q14 Exercise 1.1 Q1 (v) Exercise 1.1 Q2 (i) Exercise 1.1 Q2 (ii) Exercise 1.1 Q2 (iii) 30/2/1 2026 / Section A Q18 Exercise 1.1 Q3 (i) 430/1/1 2026 / Section A Q19 CBSE-ADDL2 2024 / Section A Q19 Exercise 1.1 Q3 (ii) 30/5/1 2023 / Section A Q20 430/3/1 2024 / Section A Q20 Exercise 1.1 Q3 (iii) 30/2/1 2023 / Section B Q21 30/4/1 2023 / Section B Q21 430/4/1 2024 / Section B Q21 430/4/1 2026 / Section B Q21 430/5/1 2023 / Section B Q21 CBSE-ADDL1 2024 / Section B Q21 CBSE-ADDL2 2024 / Section B Q21 Exercise 1.1 Q4 430/2/1 2023 / Section B Q22(a) Exercise 1.1 Q5 30/3/1 2026 / Section B Q23(a)