If `P_1,P_2,......... P_(m+1)` are distinct prime numbers. Then the number of factors of `P_1^nP_2P_3....P_(m+1)` is :

If P_(1),P_(2),.......P_(m+1) are distinct prime numbers.The the number of factors of P_(1)^(n)P_(2)P_(3)...P_(m+1) is :

If n is a natural and n=p_1^(x_1)p_2^(x_2)p_3^(x_3)," where "p_1,p_2,p_3 are distinct prime factors, then the number of prime factors for his

If n is a natural number and n=p1x_(1)backslash p2x_(2)backslash p3x_(3), where p_(1),backslash p_(2),backslash p_(3) are distinct prime factors,then the number of prime factors for n is x_(1)+x_(2)+x_(3)(b)x_(1)+x_(2)+x_(3)(c)(x_(1)+1)(x_(2)+1)(x_(3)+1) (d) None of the above

If 2^p + 1 is a prime number, then p must be power of:

The number 2^(P)-1 is a prime number for

A is a set containing n elements. A subset P_1 is chosen and A is reconstructed by replacing the elements of P_1 . The same process is repeated for subsets P_1,P_2,....,P_m with m>1 . The number of ways of choosing P_1,P_2,....,P_m so that P_1 cup P_2 cup....cup P_m=A is (a) (2^m-1)^(mn) (b) (2^n-1)^m (c) (m+n)C_m (d) none of these

A is a set containing n elements. A subset P_1 is chosen and A is reconstructed by replacing the elements of P_1 . The same process is repeated for subsets P_1,P_2,....,P_m with m>1 . The number of ways of choosing P_1,P_2,....,P_m so that P_1 cup P_2 cup....cup P_m=A is (a) (2^m-1)^(mn) (b) (2^n-1)^m (c) (m+n)C_m (d) none of these

A is a set containing n elements. A subset P_1 of A is chosen. The set A is reconstructed by replacing the elements P Next, a of subset P_2 of A is chosen and again the set is reconstructed by replacing the elements of P_2 , In this way, m subsets P_1, P_2....,P_m of A are chosen. The number of ways of choosing P_1,P_2,P_3,P_4...P_m

A is a set containing n elements. A subset P_1 of A is chosen. The set A is reconstructed by replacing the elements P Next, a of subset P_2 of A is chosen and again the set is reconstructed by replacing the elements of P_2 , In this way, m subsets P_1, P_2....,P_m of A are chosen. The number of ways of choosing P_1,P_2,P_3,P_4...P_m

A is a set containing n elements. A subset P_1 of A is chosen. The set A is reconstructed by replacing the elements P Next, a of subset P_2 of A is chosen and again the set is reconstructed by replacing the elements of P_2 , In this way, m subsets P_1, P_2....,P_m of A are chosen. The number of ways of choosing P_1,P_2,P_3,P_4...P_m