Mat2125 Lec 01
Mat2125 Lec 01
Winter 2021
cn = (1 + x)n ≥ 1 + nx = 1 + x + (n − 1)x ≥ 1 + x = c.
In that case, the last inequality above is strict and so cn > c > 1,
which implies cn > 1 by transitivity of >.
(b) If 0 < c < 1, there exists b > 1 such that c = 1b . Indeed, 1c is such that
c · 1c = 1. As c > 0, then 1c > 0 since the product c · 1c = 1 is positive.
Let n ∈ N. Then
1 n 1
= b ≥ b =
cn c
so that c ≥ cn and
1 n
n
= b >1
c
so that 1 > cn if n > 1.
Proof.
(a) It is sufficient to show that if m ≥ n, then cm ≥ cn. (Why is this the
case? Don’t let this slip by without understanding.)
(b) This can be shown from part (a) using the technique from the previous
question.
Proof.
Does S2 have lower bounds? Yes.
By definition, any negative real number is a lower bound (so is 0).