Finding a limit of recursively given sequence

Given a sequence {an}

n=1
:
a1=2
∀n∈N:an+1=4−
3
an
find limn→∞an
. Writing out first few terms i found out an→3
as n→∞
. But i would like it to be in more precise way (the best would be the ϵ
-definition). So I attempted to get a direct formula for an
not depending on any other ai
's but also couldn't find a suitable way to do that. Could you please give me some hints, how to go about this problem in more mathematical way?

Комментарии

Популярные сообщения из этого блога

Skipping acquire of configured file 'contrib/binary-i386/Packages' as repository … doesn't support architecture 'i386'

FillChar and StringOfChar under Delphi 10.2 for Win64 Release Target

Python Selenium - How to configure a client certificate file while initializing PhantomJS driver instance