anyone?
the question in this link:
http://img372.imageshack.us/img372/7929/76106583tn6.gif
this question is obvious
its common sense
if a(n) converges to a
then if we take the function who takes the biggest member
of course it will pick the closest to "a"
it take the largest member from a1 to an
for example:
a1=6 a2=5 a3=6 a4=1 a5=8 a6=7
b1=6 b2=6 b3=6 b4=6 b5=8 b6=8
i dont know how to transform these word into math
??
the definition of convergens states that
if a sequence is bounded and monotonic then it converges
An->a
Bn=max{till An }
Since no one else is trying this I will give a suggestion. This is not a full solution but merely a possible building block for you to work off of. Because of the neccessary montonicity of why not consider three cases: , , or
Case Three needs no explanation.
If case two is true then obviously
And if case one is the case then we would have that
So now we just need to use the fact that to show that
By the definition of we have that for every there exists a such that implies
So now because of the above we have that whenever so
its seems like a fool proof what else do i need to prove here?
case1: An<An+1
case2: An>An+1
case3: An=An+1
if case1 is true:
then MAX will pick the member with the biggest n which is An^2
and you showed how to prove that if An->0 then An^2->0
if case 2 is true:
it will pick An and by definition An goes to 0
if case3:
then no matter what it will pick because its the same.
and all the members are equaled to An
so they all go to 0.
so it lookes pretty much complete
what do i miss??