Monday, December 23, 2019

limits - Show that frac3n2n8 grows faster than 2nlog(n)log(log(n))



Basically, I want to show the limit of the second function over the first function as n approaches infinity is 0, but I'm not sure how to get past the complicated nature of the second function. I would try to show that 3n2 grows faster than 2n2, which is faster than the second function, but the limit of those two functions is 23 I think.



Also, the logarithms are base 2, if that changes anything.


Answer



Well, you have that

3n2n8=exp(n2log3)n8=exp(n2log3)exp(8logn)=exp(log(3)n28logn)


versus
exp(log(2)nlog(n)loglog(n)).

Since n2 grows faster than nlognloglogn, then we see that 3n2n8 grows faster than 2nlognloglogn.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...