We are given that \( N^2 \) is divisible by 24. Since:
\[ 24 = 2^3 \times 3 \]
This means that \( N^2 \) must be divisible by both 8 and 3. Therefore, \( N \) must have at least half the prime powers of 24 in its prime factorization.
For \( N^2 \) to be divisible by 24, \( N \) must be divisible by the square root of 24:
\[ \sqrt{24} = \sqrt{2^3 \times 3} = 2^{\frac{3}{2}} \times 3^{\frac{1}{2}} \]
The smallest integer satisfying this condition is:
\[ N = 2^2 \times 3 = 12 \]
Therefore, the greatest number by which \( N \) must be divisible is 12.
Directions: In Question Numbers 19 and 20, a statement of Assertion (A) is followed by a statement of Reason (R).
Choose the correct option from the following:
(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.
Assertion (A): For any two prime numbers $p$ and $q$, their HCF is 1 and LCM is $p + q$.
Reason (R): For any two natural numbers, HCF × LCM = product of numbers.