Ans
D
This one is tricky....
For any given no we can calculate the total no of factors if we know its prime factors, and the no of times they repeat.
lets say the prime factors of n are x(repeated a times), y (repeated b times), z(repeated c times)
Now the no of total factors of any number is given as a product of 1+ the power of each prime number in the number n. ...(1)
So if n = 12 = 2*2*3 = 2^2 * 3^1 total no of factors = (2+1)*(1+1) = 3*2 =6
Now we also know that a number can have an odd no of factor only if it is a perfect square; which means in our number 'n' atleast one prime factor is repeated
so lets say n = X^2 * y^b *z^c ( b & c were assumed earlier)
now using the formula in 1.
(2+1) *(b+1) *(c+1) = 9
this imples that 'n' will be = x^2 y^2
now to determine x & y....
1) n divisible by 175 (5*5*7) this immediately tells us the 'missing factor' is 7
so n = 5*5*7*7 ; now look at the factors of 6 n
6 n = 2*3* 5^2*7^2
now using (1) the # of factors = (1+1)*(1+1)*(2+1)*(2+1) = 36; thus sufficient
2) this statement just confirms that n and 6 n do not have 2& 3 as common factors....
which means n = x^2* y^2 * 2*3
again here we don't need to know the factors such the exponents of the prime factors ; so ans = 36 - sufficient
kevincan is there a shorter method?