Show that n^2 < 2^n for n > 5. Solution by induction.: Assume the result for n. (ie) n^2 < 2^n. For n+1, consider, (n+1)^2 - n^2 = 2n+1<2^n for n >2. Using induction (n+1)^2 < n^2+2^n < 2^n + 2^n =2(2^n) =2^(n+1). This true for n > 5 and equality holds if n = 4.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.