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

If $f(n)$ is any polynomial in n with positive coefficients, how could I prove that $\log f(n)$ is $O(\log n)$? I've been having trouble how to do this for a while now.

share|cite|improve this question
Oh yea sorry about that, I just edited the question! – OpMt Oct 4 '12 at 6:03
up vote 5 down vote accepted

Hint: Let $d$ be the degree of $f$, and let $M$ be an upper bound on the coefficients. Then $$f(n)\le (d+1)(M)(n^d).$$ Now take the logarithm.

share|cite|improve this answer

Here's a very quick-and-dirty solution. Since we know $f(n)$ is a polynomial in $n$, we have $f(n)=O(n^m)$ for some $m\in N$. This is to say there's a positive constant $c: f(n) \leq cn^m$ for sufficiently large $n$. Taking logarithms on both sides, we have $\log f(n) \leq \log(c) + m \log(n)$; we can weaken this to $\log f(n) \leq (m+c) \log (n)$. This proves your result.

share|cite|improve this answer

First of all, $f(n) = O(n^p)$ where $p$ - degree $f$, it means that $\frac{f(n)}{n^p}\to C$ as $n\to\infty$.

Then $\log(\frac{f(n)}{n^p})\to \log(C)$ and $\log(f(n)) - p\log(n)\to \log(C)$, dividing by $\log(n)$ have $\frac{\log(f(n))}{\log(n)} \to p$. As $p$ is constant we obtain $\log(f(n)) = O(\log(n))$

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.