Big O Hierarchy log log 16 less than 1

137 Views Asked by At

My lecture has given me a Big O hierarchy table that shows $1 \leq \log(\log(16))$.

How is this possible given $\log(\log(16)) = 0.08066976367$?

More specifically, $1 \leq log(log(n))$ for all $n\geq16$


Edit: adding this table to clarify my source enter image description here

2

There are 2 best solutions below

1
On

I think you are using $\log = \log_2$, so $\log_2 16 = 4$ and $\log \log 16 = 2$...

0
On

Found another issue. I was using desmos.com and inputting my expressions incorrectly. x^3logx is not the same as x3 * ln(x)