# Math Help - size order sequences,

1. ## size order sequences,

Can someone please explain how I would approach this question, other thanplugging in numbers and trying to figure it out from there?

Is the last one the biggest ?

thank you.

2. ## Re: size order sequences,

Originally Posted by Tweety
Can someone please explain how I would approach this question, other thanplugging in numbers and trying to figure it out from there? Is the last one the biggest ?
You need a lot of experience with these functions.

For example, the first is an increasing sequence bounded above by $e^2$ its limit.

You need to know that for $F>1$ then $\log(F)< F$.

So $\log(n^{2^{-1}}\log(n))< n^{2^{-1}}\log(n)$

Here is a hint on the last one: $\frac{n!}{n^n}\le 1~.$ WHY?