Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

Thank you for the answers to my earlier question. By working through all your answers, I arrive at a more refined question below.

Fix a positive real constant $b$. Let $x_0$ be the smallest nonnegative real number such that the inequality $2^x\ge bx$ holds for all $x\ge x_0$. Does there exist a constant $C>0$ such that $x_0≤C \log_2 b$?

I showed that $x_0$ has order $O(b^\epsilon)$ in my workings in the earlier question.

share|cite|improve this question
up vote 1 down vote accepted

For every $x\geqslant4$, $2^{x/2}\geqslant x$. Hence, if $x\geqslant4$ and $2^{x/2}\geqslant b$, then $2^x=2^{x/2}\cdot 2^{x/2}\geqslant bx$. To sum up:

If $x\geqslant\max\{4,2\log_2b\}$, then $2^x\geqslant bx$.

In particular, for every $b\geqslant4$, if $x\geqslant2\log_2b$, then $2^x\geqslant bx$, that is, the assertion you are interested in holds with $C=2$. (But note that $x_0(b)\sim\log_2b$ when $b\to+\infty$.)

share|cite|improve this answer

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.