Elegant way to solve $n\log_2(n) \le 10^6$ I'm studying Tomas Cormen Algorithms book and solve tasks listed after each chapter.
I'm curious about task 1-1. that is right after Chapter #1.
The question is: what is the best way to solve: $n\lg(n) \le 10^6$, $n \in \mathbb Z$, $\lg(n) = \log_2(n)$; ?
The simplest but longest one is substitution. Are there some elegant ways to solve this? Thank you!
Some explanations: $n$ - is what I should calculate - total quantity of input elements, $10^6$ - time in microseconds - total algorithm running time. I should figure out nmax.

For my money, the best way is to solve $n\log_2n=10^6$ by Newton's Method. 
