Allan Jiang
Reputation
Top tag
Next privilege 125 Rep.
Vote down
 Sep 24 awarded Autobiographer Apr 21 comment Ratios in big-O notation? I think the accepted answer is good, thanks for adding a bounty Feb 27 accepted Prove $(\log_2n)^{100} = \mathcal O(n^{1/10})$ Feb 27 comment Prove $(\log_2n)^{100} = \mathcal O(n^{1/10})$ Hi I am not sure about your suggestion. Do you mean I should take log of the O-notation part as well? What will that leads me? Thank you very much! Feb 27 comment Prove $(\log_2n)^{100} = \mathcal O(n^{1/10})$ @J.D. It is like that in my textbook... Feb 27 comment Prove $(\log_2n)^{100} = \mathcal O(n^{1/10})$ @HenningMakholm I tried to follow the way you said and it led me to O(n) but not O(n^(1/10))... I am not sure how I can approach that Feb 27 awarded Editor Feb 27 revised Prove $(\log_2n)^{100} = \mathcal O(n^{1/10})$ edited body Feb 27 comment Prove $(\log_2n)^{100} = \mathcal O(n^{1/10})$ Thank you very much! Feb 27 asked Prove $(\log_2n)^{100} = \mathcal O(n^{1/10})$ Feb 8 accepted Ratios in big-O notation? Feb 8 comment Ratios in big-O notation? This is a question from my algorithm text book. So far I just assume there might be a way on the left side to cancel out the critical terms by dividing, but the right side can keep what ever it is. But I couldn't come up with a complete solution to it. @templatetypedef Feb 8 asked Ratios in big-O notation? Feb 6 awarded Supporter Feb 6 accepted An expression of $1\cdot2 + 2\cdot3 + \cdots + n\cdot(n+1)$ Feb 6 awarded Scholar Feb 5 awarded Student Feb 5 asked An expression of $1\cdot2 + 2\cdot3 + \cdots + n\cdot(n+1)$