# Is there a property for log(n)/n? I found a small exercise which I couldn't figure what to do, so I found a solution. Then I tried to understand it and everything went well until I got to this part: 1/8=log(n)/n Then it just skipped and say that the answer was n=43. I was wondering if there is some kind of property for log(n)/n I don't know about. Or otherwise, how was this solved? EDIT: This is the exercise Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 64n lg n steps. For which values of n does insertion sort beat merge sort?

Is there a property for log(n)/n?
I found a small exercise which I couldn't figure what to do, so I found a solution. Then I tried to understand it and everything went well until I got to this part:
$\frac{1}{8}=\frac{\mathrm{log}\left(n\right)}{n}$
Then it just skipped and say that the answer was $n=43$. I was wondering if there is some kind of property for $\mathrm{log}\left(n\right)/n$ I don't know about. Or otherwise, how was this solved?
EDIT: This is the exercise Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 64n lg n steps. For which values of n does insertion sort beat merge sort?
And this was the solution given:
$8{n}^{2}=64n\mathrm{log}\left(n\right)$
${n}^{2}=8n\mathrm{log}\left(n\right)$
$n=8\mathrm{log}\left(n\right)$
$\frac{1}{8}=\frac{log\left(n\right)}{n}$
You can still ask an expert for help

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

nezivande0u
If we take your amended question, which asks us to solve the inequality:
$8{n}^{2}<64n{\mathrm{log}}_{2}\left(n\right)$
We can therefore divide both sides by $64n$ to get:
$\frac{n}{8}<{\mathrm{log}}_{2}\left(n\right)$
This has to be solved by numerical methods and we see that we have (by Mathematica):
$1.1
And we note that $n$ must be an integer so we have:
$⌈1.1⌉=2