A.

prove that for n 1

1 3

?

B.

prove that

and find the limit

?

Printable View

- February 18th 2011, 11:56 AMtransgalacticseries convergens mn1 q1

A.

prove that for n 1

1 3

?

B.

prove that

and find the limit

? - February 18th 2011, 12:24 PMTarask
it's a sequence not a serie.

Here are some hints:

A) Induction using the fact that the function defined by http://latex.codecogs.com/gif.latex?f(x)=\frac{4x-3}{x} is increasing (because f'(x) is postive) then induction using http://latex.codecogs.com/gif.latex?f(a_{n})=a_{n+1}

B) http://latex.codecogs.com/gif.latex?(a_{n}) is increasing and bounded (is that the word because i don't study maths in english :D ) so it convergences then solve f(x)=x to compute the limit.

Hard luck . - February 18th 2011, 01:07 PMtransgalactic
i only started to learn it

i tried to look on google for similar

solved questions but i dint find any.

do you have any web site which explain the theory of this subject

?

and some solved similar questions - February 18th 2011, 01:41 PMTarask
First of all , i wanna know if you understood my hints , if you didn't i can write the complete solution .

I actually have some similar problems in french and arabic , wait some minutes so that i can translate and post them ;) - February 18th 2011, 02:00 PMTarask
http://latex.codecogs.com/gif.latex?...rac{3}{4}u_{n}

we consider the function f such that http://latex.codecogs.com/gif.latex?...2+\frac{3}{4}x

1)show that http://latex.codecogs.com/gif.latex?...frac{1}{4}%20]

2) show that for every positive integer n : http://latex.codecogs.com/gif.latex?...%20\frac{1}{4}

3)Study the monotony of http://latex.codecogs.com/gif.latex?(u_{n}) then deduce that it converges.

4) compute it's limit .

Hard luck . - February 18th 2011, 04:02 PMtransgalactic
cant understand the first condition

you say that the values of F output is a part of its range

?

on convergence we have lagrange test cauchy test

you didnt say any thing about it? - February 19th 2011, 02:14 AMTarask
We don't have to use Lagrange or Cauchy , those are simple sequences.

Let's stay with your problem:

A) we will use mathematical induction:

for n=1 we have 1=<2=<3 so 1=<a_{0}=<3

we assume that it's true for n and let's prove it for n+1

since 1 3 and f is increasing we have http://latex.codecogs.com/gif.latex?..._{n+1}\leq%203

End of induction .

B) let's prove that (a_{n}) is increasing :

http://latex.codecogs.com/gif.latex?...a_{n}}\geq%200 we have now proved that it's increasing .

Now and since it's bounded , it converges.

As i said , to compute the limit , solve the equation f(x)=x - February 19th 2011, 08:01 AMchisigma
The 'initial value' is not specified and that isn't a minor detail. The 'recursive relation' can be written as...

(1)

The function f(*) is represented here...

http://digilander.libero.it/luposabatini/MHF108.bmp

There is only one 'attractive fixed point' at and that means that, if the sequence converges, it converges to 0. In particular the sequence converges monotonically for , converges 'with oscillation' for and diverges for and ...

Kind regards

- February 19th 2011, 08:37 AMTarask
Actually u_0=1/5 .

Sorry i was in a hurry. - March 2nd 2011, 01:19 AMtransgalactic
- March 3rd 2011, 07:24 AMtransgalactic
so to find the limit we put L instead of a_n and a_n+1 and compute the roots?