Scribd
Upload
19 views2 pages

Numerical Sequences

Uploaded by

browhat22234
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views2 pages

Numerical Sequences

Uploaded by

browhat22234
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

E.N.S.N.N.

First year
Analysis I 2024 - 25

Exercise Series N° 2 Numerical sequences.

Exercise 1 Using the definition, show that


1 2n − 3 2 2n3 − 1
1) lim √ = 0, 2) lim = , 3) lim = +∞.
n→+∞ n n→+∞ 3n + 5 3 n→+∞ n + 2

Exercise 2 Study the nature of the sequence (un ) in each of the following cases:
2 √ n
a) un = n+1
n
; b) un = n2 + 1 − n; c) un = e−n sin (n2 + 1); d) un = 10n! ;
n √ √
e) un = nn! ; f ) un = sinn n ; g) un = (−1)n + n1 ; h) un = 3 n + 1 − 3 n.
Exercise 3 Study the nature of the sequence (un ):
1.3.....2n − 1 1 1 1
1) un = , 2) un = + + ... + .
2.4.....2n n+1 n+2 2n

n
X 1
Exercise 4 For n a non-zero natural integer, we define Hn = (harmonic series).
k=1
k
1
1. Using the integral of x
over the interval [k, k + 1], show that :

∀n ∈ N∗ , ln(n + 1) < Hn < 1 + ln(n)

and deduce lim Hn .


n→+∞

2. For n a non-zero natural integer, we define un = Hn − ln(n) and vn = Hn− ln(n + 1).
Show that the sequences (un ) and (vn ) converge to a real number γ ∈ 21 , 1 (where γ is
called Euler’s constant). Provide an approximate value of γ to within 10−2 .

Exercise 5 Let A be a bounded subset of R and x a real number.

1. Show that x = sup(A) if and only if (x is an upper bound of A and there exists a sequence
(xn )n∈N of A that converges to x).

2. State a similar result for inf(A).

Exercise 6 Let (un )n∈N be a sequence of R. What do you think of the following statements:
• If (un )n converges to a real `, then (u2n )n and (u2n+1 )n also converge to `.
• If (u2n )n and (u2n+1 )n are convergent, then (un )n is also convergent.
• If (u2n )n and (u2n+1 )n are convergent to the same limit `, then (un )n also converges to `.
Exercise 7 We define recursively the sequences (un )n∈N and (vn )n∈N as follows:

u2n vn2
u0 = 1, v0 = 2, un+1 = , vn+1 = .
un + vn un + vn
1. Show by induction that un > 0 and vn > 0.

2. Show that the sequences (un )n∈N and (vn )n∈N are decreasing. Deduce that they converge
to ` and `0 respectively. Show that ``0 = 0.

1
3. Show that the sequence (vn − un )n∈N is constant. Deduce ` and `0 .

Exercise 8 Let a > 0. The sequence (un ) is defined by:


 
1 a
u0 > 0 & un+1 = un + , n ≥ 0.
2 un
√
We aim to show that the sequence (un ) converges to a.
1) Show that
1 2
u2n+1 − a = 2 u2n − a , n ≥ 0.
4un
√
2) Show that un ≥ a, ∀n ≥ 1.
3) Deduce that (un ) is convergent and compute its limit.
4) For a = 2, check that the subset A = (un )n ⊂ Q and bounded above but sup A ∈
/ Q.
Exercise 9 Let the sequence (un ) be defined by:
1
u0 = 2 & un+1 = 1 + , n ≥ 0.
un
1) Verify that 1 ≤ un ≤ 2, ∀n ≥ 0.
2) Study the nature of the sequence (un ) and determine its limit if it exists.
Exercise 10 Let the sequence (un )n∈N be defined by:
1 1
u0 ∈ R, and un+1 = + , ∀n ∈ N.
2 1 + un
1) Study the case u0 = 1.
In the rest, we set u0 = 2.
2) Show that ∀n ∈ N, 12 ≤ un ≤ 2. Verify that (un ) is not monotonic.
3) Show that ∀n ≥ 1, |un+1 − un | ≤ 94 |un − un−1 |.
Deduce that the sequence (un )n∈N is convergent and find its limit.
Exercise 11 Let a sequence (un )n∈N be defined as:
 
1 3 1
u0 ∈ , and un+1 = √ , ∀n ∈ N.
2 4 un

1) Show that
1 3 1 1 3 1+x 10
∀x ∈ [ , ], ≤√ ≤ & 2
≥ .
2 4 2 x 2 x 9

2) Show that
u2n+1
∀n ∈ N, |un+1 − 1| ≤ |un − 1|.
1 + un
Deduce that the sequence (un ) is convergent and calculate its limit.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy