https://www.gregmat.com/problems/quant?problem=a-positive-integer-with-three-distinct
i did not understnad the question and more over wasnt able to comprehend or even move forward. So please help me and tell me how can i counter these kinds of questions
You’re told that a number n is such that n = p_1^{a_1} \cdot p_2 ^ {a_2} \cdot p_3 ^ {a_3}, where the p_i are distinct prime numbers. As a further note, the a_i exponents need not be distinct. You are to choose an option (out of the 5 you’re given) that cannot be the total number of divisors (positive and negative), no matter your choice of suitable p_i’s and a_i’s. Do you follow so far?