# How is $n^{log(n)} > n^c$ always for any c? [duplicate]

This question already has an answer here:

I was going through the questions in MIT quiz : Question 2 g and I found this How is $n^{log(n)} > n^c$ always for any c ?

what if c > log(n) ?

## marked as duplicate by Raphael♦ algorithms StackExchange.ready(function() { if (StackExchange.options.isMobile) return; $('.dupe-hammer-message-hover:not(.hover-bound)').each(function() { var$hover = $(this).addClass('hover-bound'),$msg = $hover.siblings('.dupe-hammer-message');$hover.hover( function() { $hover.showInfoMessage('', { messageElement:$msg.clone().show(), transient: false, position: { my: 'bottom left', at: 'top center', offsetTop: -7 }, dismissable: false, relativeToBody: true }); }, function() { StackExchange.helpers.removeMessages(); } ); }); }); May 1 '17 at 0:17

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

• For the future (and past questions) please transcribe images into text or LaTeX. Thank you. – Evil May 1 '17 at 4:31

## 1 Answer

In these exercises, you are asked to compare functions only according to their asymptotic behavior.

In this case, $c$ is a constant function of $n$, while $\log(n)$ is a function of $n$ that approaches $+\infty$ when $n$ becomes large.

So, $c > \log(n)$ can only hold for finitely many values of $n$.