Suppose that . Show that if for all , then .

Prove by contradiction and by choosing .

I have a standard proof for how to solve this, but not a contradictory proof (which is what I need). Can someone help with that?

Printable View

- Mar 10th 2010, 01:50 PMRuntyA limit of a sequence problem
Suppose that . Show that if for all , then .

Prove by contradiction and by choosing .

I have a standard proof for how to solve this, but not a contradictory proof (which is what I need). Can someone help with that? - Mar 10th 2010, 01:58 PMPlato
If you assume that then makes sense.

That is by contradiction. - Mar 10th 2010, 02:14 PMRunty
- Mar 10th 2010, 02:43 PMPlato