Lisa91
- 29
- 0
How to prove that n^{\alpha} > \ln(n) for \alpha>0?
The discussion centers on proving the inequality \( n^{\alpha} > \ln(n) \) for \( \alpha > 0 \) and sufficiently large \( n \). It is established that for \( n > 1 \), the condition \( \alpha \ln(n) > \ln(\ln(n)) \) must hold, which implies \( \alpha > \frac{\ln(\ln(n))}{\ln(n)} \). As \( n \) increases, the right-hand side approaches zero, confirming that for any positive \( \alpha \), there exists a threshold \( N \) such that the inequality holds for all \( n > N \). The discussion also highlights the need for clarity regarding whether the inequality must hold for all \( n \) or only for sufficiently large \( n \).
PREREQUISITESMathematicians, students studying calculus or real analysis, and anyone interested in inequalities involving exponential and logarithmic functions.
ZaidAlyafey said:2-Now for n>1 :
${\alpha}\ln(n)> \ln(\ln(n)) \Rightarrow \,\, \alpha> \frac{\ln(\ln(n))}{\ln(n) } $
ILikeSerena said:Since the right hand side approaches zero for large n, this means that for any $\alpha>0$ there is a number N such that the inequality is true for any n > N.
ZaidAlyafey said:since $\alpha $ is an independent variable of n I can choose it as small as possible so that
it becomes lesser than the right-hand side .
Can you give a counter example for $\alpha$ and n that disproves my argument ?