For any two arbitrary prime numbers \( p_1 \) and \( p_2 \), their product \( p_1 p_2 \) will always have more than two divisors (i.e., 1, \( p_1 \), \( p_2 \), and \( p_1 p_2 \)), which means it cannot be a prime number.
Thus, the correct answer is (B).The largest $ n \in \mathbb{N} $ such that $ 3^n $ divides 50! is:
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.