0

show that $(\sqrt n)^\sqrt n=o(2^{n^{0.6}})$

i just know that small o-complexity of $\sqrt n=o(n)$ but how to prove this

fade2black
  • 9,827
  • 2
  • 24
  • 36
Inverse Problem
  • 109
  • 1
  • 1
    Could you provide the source? From where did you take this problem? A book, lecture notes... – fade2black Oct 05 '17 at 11:52
  • This question has now two answers that are both absolutely wrong. That needs to be addressed. – gnasher729 Oct 05 '17 at 18:44
  • @gnasher729 Are the tools from the linked question not enough? – Raphael Oct 06 '17 at 08:13
  • 1
    @Raphael, I think they are and if the question is about taking those limits, it's not a question for CS.SE. But those answers were incorrect, by the time gnasher729 wrote the comment. – rus9384 Oct 06 '17 at 12:42
  • Agreed. Suresh, please read the reference question. If computing the limit is beyond you, [math.SE] would be the place to get help with that. Good luck! – Raphael Oct 06 '17 at 13:20
  • That reference section could do with a section what happens when you take the logarithm on both sides. PS. The question is a nice example where drawing a graph and drawing conclusions will absolutely give you the wrong answer. – gnasher729 Oct 06 '17 at 13:32

0 Answers0