To find the number of positive divisors of a number, we first find its prime factorization.
Step 1:
The prime factorization of 1080 can be found by dividing it by the smallest prime number and continuing the process: \[ 1080 \div 2 = 540, \quad 540 \div 2 = 270, \quad 270 \div 2 = 135, \quad 135 \div 3 = 45, \quad 45 \div 3 = 15, \quad 15 \div 3 = 5. \] Finally, \( 5 \div 5 = 1 \). So, the prime factorization of 1080 is: \[ 1080 = 2^3 \times 3^3 \times 5. \]
Step 2:
The number of divisors of a number is given by the formula: \[ \text{Number of divisors} = (e_1 + 1)(e_2 + 1) \dots (e_k + 1), \] where \( e_1, e_2, \dots, e_k \) are the exponents in the prime factorization of the number. For \( 1080 = 2^3 \times 3^3 \times 5^1 \), the exponents are 3, 3, and 1. Therefore, the number of divisors is: \[ (3+1)(3+1)(1+1) = 4 \times 4 \times 2 = 32. \] Thus, the number of divisors of 1080 is: \[ \boxed{32}. \]
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.