Proof of limit:
The sequence defined by converges to .
.
Scratch work.
Let .
Set
Proof.
Let . Fix . Let
Then
Prove that
Scratch work
Proof. Let . Fix . Let . Then
Thus .
E 33.8 =
HW 33
Ben Finch
E 33.1
a)
b)
4, 8, 16, 32, 64, 128
c)
d)
E 33.2
a)
b)
E 33.3
a) Proof. We have two cases:
Suppose . Thus . Then so .
Suppose . Thus . Then , so .
b) Proof. We have two cases:
Suppose . Thus . Then so .
Suppose . Thus . Then so .
c) Proof. Assume . We have two cases:
Suppose . Then .
Suppose . Then .
E 33.4
Scratch work:
Proof.
Let . Fix . Let . Then
Thus and so the .
E 33.5 Scratch work:
Proof.
Let . Fix . Let . Then
Thus .
E 33.6
The sequence does converge with a limit at .
Scratch Work:
Proof.
Let . Fix . Let . Then
Thus . So the sequence converges with a limit at 1.
E 33.7
Let . We want to find such that for all , holds.
Since for all , we can see that:
The inequality holds for any positive , as is less than any positive number.
Therefore, we can choose any , for example , and the condition will be satisfied for all , because the left-hand side of the inequality is always , which is less than any positive .
This proves that the constant sequence converges to .
E 33.8 Proposition.
Proof.
Fix . We want to show that for any real number , there exists a natural number such that .
For any given , choose to be the smallest integer greater than . Then .
If , then .
If , then .
Therefore, no matter how large we choose , we can always find an such that , which means the sequence does not converge to .
E 33.9 Scratch work:
Proof. Let . Fix . Let . Then
Thus .
E 33.10
a) Proof.
Let be given. Since , the sequence converges to 0. Hence, there exists an such that for all , . Then for all :
Thus, converges to 0.
b) Proof.
Suppose . Then cannot converge to 0, because for , would stay at , and for , would increase unbounded. Since is given to converge to 0, we must have .
c)
Proof.
Let and . Since , as . Thus, also tends to infinity as increases, so diverges.