This is from an exercise (1.2.2) in introduction to algorithms that I'm working on privately.
To find at what point a $n \lg n$ function will run faster than a $n^2$ function I need to figure out for what value $n$
$8n^2 > 64n \lg n$
(with lg here being the binary log) after some elementary simplification we get
$n > 8\lg n$
Playing around with properties of log I can further get this to
$n^8 < 2^n$
or
$n < 2^{n/8}$
While I'm sure it's something very elementary I've lost somewhere over the years, after checking out a few logarithm tutorials I'm just not finding how to get any further on this.
Any help with solving for $n$ would be appreciated.