Lisa91
- 29
- 0
How to prove that n^{\alpha} > \ln(n) for \alpha>0?
The discussion revolves around proving the inequality \( n^{\alpha} > \ln(n) \) for \( \alpha > 0 \) and sufficiently large \( n \). Participants explore different conditions and scenarios under which this inequality may hold, as well as potential counterexamples.
Participants express differing views on the conditions under which the inequality holds. Some believe it is valid for sufficiently large \( n \) given any \( \alpha > 0 \), while others suggest that the inequality may not hold for all \( n \) and that clarification on the problem statement is needed.
There is uncertainty regarding the definitions of \( n \) and \( \alpha \), as well as the scope of the inequality. The discussion highlights the need for precise conditions under which the inequality is claimed to be true.
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 ?