I think E should be the option.we need to find out the number of positive factors of \(3^{n}*p^{2}\)
Any expression which can be prime factorised in the following way:
\(a^{x}*b^{y}*c^{z}\) has (x+1)*(y+1)*(z+1) number of positive factorsSattement 1:n=3
the expression becomes \(3^{3}*p^{2}\)
We shall analyse few cases and see if we get conclusive result.
p is a prime number so let's try for p=2 and p=3
for p=2 it is \(3^{3}*2^{2}\) which has 4*3 = 12 factors
for p=3 it is \(3^{5}\) which has 6 factors
Insufficient.
Sattement 2:p is an odd number => p is an odd prime
Again if p is not 3 , we have number of factors as (n+1)*3
else if p=3, we have \(3^{n+2}\) so n+3 factors
Not conclusive. InsufficientStatement 1 and 2 together make our case like this:
\(3^{3}*p^{2}\) which in turn will give us same result as Statement 1 as done.
Neither of the statements is sufficient.
Hence, Option E should be correct.