Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

On page 3 of the author write that the following inequalities follow from "the Hardy-Ramanujan inequality", but he doesn't point to a proof. The inequalities state that $$ \# \left \{ n \le t \mid \omega(n) \ge \lambda \log \log t \right \} = O \left ( \frac{e^{\lambda}t}{(\log t)^{1+\lambda \log (\lambda/e)}}\right ) $$ $$ \# \left \{ n \le t \mid \omega(n) \le \lambda \log \log t \right \} = O \left ( \frac{1}{(\log t)^{1+\lambda \log (\lambda/e)}}\right ) $$ hold uniformly for $\lambda \ge 1$ and $0 < \lambda \le 1$ respectively, where $\omega(n)$ is the function that counts the number of different prime divisors in $n$.

Can anyone help me to find a proof?

share|cite|improve this question
Is it a direct corollary of this?… – Golbez Oct 18 '12 at 14:59
It looks very promising! I cannot say for sure before I've had some time to think about it, but that looks like that is what I want! Thanks! – Mathias Bæk Tejs Knudsen Oct 18 '12 at 15:17
It was sufficient. Thanks a lot :-) – Mathias Bæk Tejs Knudsen Oct 24 '12 at 19:06
Maybe add a brief answer so this doesn't appear in the unanswered queue? – daniel Oct 14 '13 at 12:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.