Infinite Limit: How to Prove a Sequence Goes to Infinity

  • Thread starter Thread starter The_Iceflash
  • Start date Start date
  • Tags Tags
    Infinite Limit
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
7 replies · 3K views
The_Iceflash
Messages
50
Reaction score
0

Homework Statement


Ok. For this sequence: [tex]a_{n} = n^2\left|cosn\pi\right|[/tex], Show/Prove that [tex]a_{n} \rightarrow\infty[/tex]


Homework Equations


N/A


The Attempt at a Solution



I have to manipulate the statement to show that
[tex]n^2\left|cosn\pi\right| > ?[/tex]

I'm having trouble making a statement that's smaller. If it was a fraction I could do it:

Ex: Manipulating [tex]\frac{n^3}{n^2+2}[/tex] gets

[tex]\frac{n^3}{n^2+2} > \frac{n^3}{n^2+n^2} = \frac{n^3}{2n^2} = \frac{n^3}{2}[/tex]

I replace 2 with n^2 to make the denominator bigger thus making it smaller. I somehow have to do something like that with the sequence given but I'm not sure how.

Any help is appreciated.
 
Last edited:
Physics news on Phys.org
Mark44 said:
I think something is missing in the problem statement. What is the exact wording of this problem?

I just added it above.
 
Mark44 said:
Prove that it's greater than what? That still doesn't make any sense.

That's what I have to figure out. The example with the fraction I showed is what I have to do somehow.
 
Mark44 said:
Assuming n is an integer, |cos(n*pi)| = 1, so n2|cos(n*pi)| = n2. What does that do if n gets large?

If n gets large then the sequence gets large.

So, would n2|cos(n*pi)| > n|cos(n*pi)| be sufficient?

After I would do that I need to set it greater than M and solve for it.

For example: the fraction above I set [tex]\frac{n^{3}}{2} > M[/tex] and solved for n.

Then I'd put it all together formally.
 
Clearly, from the earlier work, [tex]\lim_{n \to \infty} a_n = \infty[/tex]

Now, to prove that this is so, you want for find a number M s.t., for all n >= M, an > M.

You have an = n2 (reason given earlier) and you want an > M.

Can you combine these and solve for n?