The third is
{(-1)n+1 }
We write a general theoretical sequence as t1,t2,t3,... or {tn}.
n > N => |tn - 1|< e
We say that the limit of tn = 1 and we write lim tn = 1.
lim tn = b
<=>
With each strictly positive real number e,
corresponds a suitable positive integer N
such that n > N => |tn - b|< e .
We say that the sequence converges to b.
The sequence {tn} converges
<=>
With each strictly positive real number e,
corresponds a suitable positive integer N
such that n > N => |tn+p - tn|< e for each p=1,2,3,...
Proof:
First part: suppose the sequence {tn} converges to a number b.
A base environment of b, contains all the terms of {tn},
starting from a suitable term.
From this it follows that
With each strictly positive real number e,
corresponds a suitable positive integer N
such that n > N => |tn+p - tn|< e for each p=1,2,3,...
Second part: suppose that
With each strictly positive real number e,
corresponds a suitable positive integer N
such that n > N => |tn+p - tn|< e for each p=1,2,3,...
Choose a fixed value of n. We divide all real numbers in two sets.From |tn+p - tn|< e, we see that the number tn -e is exceeded by an infinitely number of elements of the sequence and belongs to set A.
From |tn+p - tn|< e, we see that the number tn +e is exceeded by a finite number of elements of the sequence and belongs to set B.
Therefore |tn - b| =< e.
Now, tn+p - b = tn+p - tn + tn - b
=> |tn+p - b| =< |tn+p - tn| + |tn - b| < 2e for p=1,2,3,...
=> | tm - b | < 2e for all m > n
=> The sequence {tn} converges
n > N => tn > r
We say that tn has an infinite limit and we write lim tn = infinity.
lim tn = +infty
<=>
With each real number r,
corresponds a suitable positive integer N
such that n > N => tn > r .
lim tn = -infty
<=>
With each real number r,
corresponds a suitable positive integer N
such that n > N => tn < r .
We say that the sequence diverges to infinity.
A real number M is an upper bound for {tn}
if and only if
for each n : M >= tn
A real number m is an lower bound for {tn}
if and only if
for each n : m =< tn
A sequence {tn} is bounded
if and only if
{tn} has an upper and a lower bound
If lim tn = b and lim tn' = b and if for all n > N : tn =< t"_n =< tn' Then lim t"_n = b
If lim tn = b and if for all n > N : tn = tn' Then lim tn' = b
If lim tn = +infty and if for all n > N : tn =< tn' Then lim tn' = +infty
If lim tn = -infty and if for all n > N : tn >= tn' Then lim tn' = -infty
If lim tn = b > 0 Then tn > 0 for all n starting from a suitable n=N
If lim tn = b < 0 Then tn < 0 for all n starting from a suitable n=N
If lim tn = b Then lim |tn| = |b|
If lim tn = b is a real number
Then,
lim r.tn = r.lim tn
lim 1/tn = 1/lim tn (if b not 0)
lim tnn = ( lim tn )n
lim tn1/p = ( lim tn )1/n (if both sides exist)
If lim tn and lim tn' are real numbers,
Then, lim (tn + tn') = lim tn + lim tn'
lim (tn - tn') = lim tn - lim tn'
lim tn.tn' = lim tn . lim tn'
tn lim tn
lim ----- = ------------ (if both sides exist)
tn' lim tn'
-(+infty)=-infty -(-infty)=+infty
+(-infty)=-infty +(+infty)=+infty
|+infty|= +infty |-infty|= +infty
(+infty)n = +infty (-infty)2n= +infty (-infty)2n+1= -infty
nth-root(+infty)=+infty (2n+1)th-root(-infty)=-infty
for each r = strictly positive real number
r(+infty)=+infty r(-infty)=-infty
-r(+infty)=-infty -r(-infty)=+infty
for each real number r
r/+infty = 0 r/-infty = 0
+infty + r = +infty -infty + r = -infty
r - infty = -infty r + infty = +infty
+infty +(+infty)= +infty
-infty +(-infty)= -infty
+infty -(-infty)= +infty
-infty -(+infty)= -infty
(+infty)(+infty)= +infty
(-infty)(+infty)= -infty
(+infty)(-infty)= -infty
(-infty)(-infty)= +infty
lim tn = +infty => lim (-tn) = -infty
lim tn = -infty => lim (-tn) = +infty
lim tn = +infty => lim |tn| = +infty
lim tn = -infty => lim |tn| = +infty
if lim tn = +infty or lim tn = -infty, then
lim tnp = (lim tn)p
lim (nth-root(tn)) = nth-root(lim tn) (if both sides exist)
lim (c.tn) = c.(lim tn) (with c real number)
lim (c/tn) = 0 (with c real number)
lim tn = +0 => lim (1/tn)=+infty
lim tn = -0 => lim (1/tn)=-infty
if lim tn = infty and lim tn'= b (real and not zero) then
lim(tn+tn')=lim tn +lim tn'
lim(tn-tn')=lim tn -lim tn'
lim(tn'-tn)=lim tn' -lim tn
lim(tn'.tn)=lim tn' .lim tn
lim(tn/tn')=lim tn / lim tn'
lim(tn'/tn)= 0
lim tn = +infty and lim tn' = +infty
=> lim(tn+tn')=lim tn + lim tn'
lim tn = -infty and lim tn' = -infty
=> lim(tn+tn')=lim tn + lim tn'
lim tn = +infty and lim tn' = -infty
=> lim(tn-tn')=lim tn - lim tn'
lim tn = -infty and lim tn' = +infty
=> lim(tn-tn')=lim tn - lim tn'
lim tn = infty and lim tn' = infty
=> lim(tn.tn')=lim tn . lim tn'
tn = t1 + (n-1).v
With each choice of t1 corresponds exactly one sequence .
S = t1 + t1 + v + t1 + 2.v + ... + tn
Now write the same sequence in reverse order
S = tn + tn - v + tn - 2.v + ... + t1
Addition gives
2.S = (t1 + tn).n
So,
(t1 + tn).n
S = ----------------
2
tn = t(n-1).q
With each choice of t1 corresponds exactly one sequence .for all n > 1 : If q = 1 + x > 1 , then qn > 1 + n.x (1)Prove:
The theorem holds for n = 2. (2)
qk > 1 + k.x
=> q.qk > (1+x).(1 + k.x)
=> qk+1 > 1 + (k + 1)x + k.x.x
=> qk+1 > 1 + (k + 1)x (3)
From (2) and (3) it follows that (1) holds for all n >1.
If q > 1 then qn is rising and has no upper bound. lim qn = +infty
1 1 n
(---) > 1 and lim (---) = +infty
|q| |q|
Hence,
n 1 1
lim |q | = lim -------- = --------- = 0
1 n +infty
(---)
|q|
tn = t1.qn-1 = t1.qn /q = (constant number) .qn If q > 1 then lim tn = + infty or -infty If q = 1 then the sequence is constant lim tn = t1 If 0 < q <1 then lim tn = 0 If -1< q <0 then lim tn = 0 If q = -1 then lim tn don't exist If q < -1 then lim tn don't exist
S = t1 + t2 + ... + tn , then
=> S.q = t1.q + t2.q + ... + tn.q
=> S.q = t2 + ... + tn + tn.q
=> S.q - S = tn.q - t1
=> S(q-1) = tn.q - t1
tn.q - t1 t1.qn - t1
=> S = ---------------- = ----------------
(q - 1) (q - 1)
t1.(qn - 1)
=> S = ----------------
(q - 1)
Take 0 < |q| < 1
t1.qn - t1 t1
S = lim ---------------- = -----------
(q - 1) (1 - q)