JEE Advance - Mathematics (1984 - No. 25)

If $$n$$ is a natural number such that
$$n = {p_1}{}^{{\alpha _1}}{p_2}{}^{{\alpha _2}}.{p_3}{}^{{\alpha _3}}........{p_k}{}^{{\alpha _k}}$$ and $${p_1},{p_2},\,\,......,\,{p_k}$$ are distinct primes, then show that $$In$$ $$n \ge k$$ $$in$$ 2
This statement is always true for all natural numbers n.
The inequality holds when n is a power of 2.
The statement is false; a counterexample can be easily found.
The inequality holds true if and only if all exponents are equal to 1.
The given inequality is a consequence of the AM-GM inequality.

Comments (0)

Advertisement