#Need help with limits

23 messages · Page 1 of 1 (latest)

vocal blaze
#

prove the limit of a sequence by definition using the ε−N approach.

rare kilnBOT
vocal blaze
#

ok, so i get the limit which is -1

#

then i put into a module where | An + 1 | = ...

#

then i put everything over the same denominator

#

and that's it

#

idk what to do next

sharp moss
#

you know what this really sucks to prove

#

but there's something you can do here

#

find the minimum (or infimum) of the roots in the denominator

#

then bound the entire modulus to that

#

but keep the numerator

#

this should easen it

#

then you can multiply by the conjugate after pulling out the factor below if that helps

sharp moss
#

but because sequences are from N to R surely at least the infimum does exist

#

i don't see the denominator turning into a straight 0 from the addition of the minimums so that's good

vocal blaze
#

jesus chirst

#

well

lament trench
#

Simply the denominator and numerator to the highest powers

#

For the numerator (n^2)^(1/3)=n^(2/3) which has a lower power than the -n^1 so u can simply the top to -n

#

For the denominator (n^2)^.5=n^1 which has a higher power than (n^4)^.2 so the bottom is n

#

Meaning at infinity the limit is -n/n=-1