How to solve $5000 n \log(n) \leq 2^{n/2}$ I'm trying to solve the following problem:
What is the smallest value of n so that an algorithm with a runtime of $5000 n \log(n)$ runs faster than an algorithm with a runtime of $2^{2/n}$ on the same computer?
So I figured it was just a matter of solving the equation $5000 n \log(n) \leq 2^{n/2}$ but I have no idea how I should do it, I've tried for a while using algebra but that's leading me nowhere.

defining $f(n)=2^{n/2}-5000n\log(n)$ i have got with the Newton method $n\approx 38.88154945$
