query: Is $n^2$ bigger than $n\log n $?
positive_passages.docid: 149758
positive_passages.text: How to prove $\log n < n$?
negative_passages.docid: 15821
negative_passages.text: $\ln(x^2)$ vs $2\ln x$
negative_passages.docid: 22687
negative_passages.text: Proof of the power rule for logarithms
negative_passages.docid: 132470
negative_passages.text: Does $\mathbb R^2$ contain more numbers than $\mathbb R^1$?
negative_passages.docid: 85731
negative_passages.text: Prove by induction that $n! > n^2$
negative_passages.docid: 135614
negative_passages.text: Show that $2^n > n^2$ whenever n>4.
negative_passages.docid: 86743
negative_passages.text: How can I simplify $\log(512)$ to $9\log(2)$?
negative_passages.docid: 88838
negative_passages.text: How can I prove this inequality for $n\geq 2$?
negative_passages.docid: 32917
negative_passages.text: Show that, for $t>0$, $\log t$ is not a polynomial.
negative_passages.docid: 1570
negative_passages.text: Show that log $Fib_{n}$ is $\theta(n)$
negative_passages.docid: 57644
negative_passages.text: Lower bounds for ${{2n} \choose {n}}$
negative_passages.docid: 148376
negative_passages.text: Proving that a Binary Tree of $n$ nodes has a height of at least $\log(n)$.
negative_passages.docid: 96458
negative_passages.text: Does $X_n \overset{L^2}{\rightarrow} X$ imply $X_n^2 \overset{L^1}{\rightarrow} X^2$?
negative_passages.docid: 119112
negative_passages.text: How to compare logarithms $\log_4 5$ and $\log_5 6$?
negative_passages.docid: 2402
negative_passages.text: Does $\sin n$ have a maximum value for natural number $n$?
negative_passages.docid: 15089
negative_passages.text: Big-O: If $f(n)=O(g(n))$, prove $2^{f(n)}=O(2^{(g(n)})$
negative_passages.docid: 136933
negative_passages.text: Which $n$ can be expressed as $x^2 − y^2$?