triclino Posted January 20, 2010 Posted January 20, 2010 Prove that the the sequence [math] n^2[/math] diverges to infinity
the tree Posted January 20, 2010 Posted January 20, 2010 The sequence is strictly increasing since [imath]\forall n \in \mathbb{N} : (n+1)^2 = n^2 + 2n + 1 > n^2 [/imath]. The sequence is not bounded above since [imath]\forall b \in \mathbb{R} , n>b : n^2 > b^2 \geq b[/imath]. And it's well known that a strictly increasing sequence is only convergent if it is bounded above. //
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now