Studentprovided answers to homework set #1, due date unspecified (not to be handed in and thus not marked). The content on this page is solely intended to function as a study aid for students and should constitute fair dealing under Canadian copyright law.
Problems to complete: (2.1) #112, (2.2) #113,16,17, (2.3) #114, (2.4) #18, #1319, (2.5) #113, (3.1) #118, (3.2) #123, (3.3) #112, (3.4) #116 (omit limsup and liminf), (3.5) #111 (omit contractive sequences), (3.6) #110.
If you notice any errors, please register or log in and edit this page, or contact @dellsystem about it.
 1 Section 2
 2 Section 3
 2.1 Section 3.1
 2.1.1 Question 1
 2.1.2 Question 2
 2.1.3 Question 3
 2.1.4 Question 4
 2.1.5 Question 5
 2.1.6 Question 6
 2.1.7 Question 7
 2.1.8 Question 8
 2.1.9 Question 9
 2.1.10 Question 10
 2.1.11 Question 11
 2.1.12 Question 12
 2.1.13 Question 13
 2.1.14 Question 14
 2.1.15 Question 15
 2.1.16 Question 16
 2.1.17 Question 17
 2.1.18 Question 18
 2.2 Section 3.2
 2.2.1 Question 1
 2.2.2 Question 2
 2.2.3 Question 3
 2.2.4 Question 4
 2.2.5 Question 5
 2.2.6 Question 6
 2.2.7 Question 7
 2.2.8 Question 8
 2.2.9 Question 9
 2.2.10 Question 10
 2.2.11 Question 11
 2.2.12 Question 12
 2.2.13 Question 13
 2.2.14 Question 14
 2.2.15 Question 15
 2.2.16 Question 16
 2.2.17 Question 17
 2.2.18 Question 18
 2.2.19 Question 19
 2.2.20 Question 20
 2.2.21 Question 21
 2.2.22 Question 22
 2.2.23 Question 23
 2.3 Section 3.3
 2.4 Section 3.4
 2.5 Section 3.5
 2.6 Section 3.6
 2.1 Section 3.1
1Section 2¶
1.1Section 2.1¶
1.1.1Question 1¶
If $a, b \in \mathbb{R}$, prove the following:
(a) If $a + b = 0$, then $b = a$;
(b) $(a) = a$;
(c) $(1)a = a$;
(d) $(1)(1) = 1$.
(a) $b = b + 0 = b + (a  a) = \underbrace{(b + a)  a}_{\text{associativity}} = \underbrace{(a + b)}_{\text{commutativity}}  a = 0  a = a$ $\blacksquare$
(b) From axiom A4, we know that $((a)) + (a) = 0$. If we add $a$ to both sides, we have $(((a)) + (a)) + a = a$. By associativity (A2) and A4 again, we can rewrite that $((a)) + ((a) + a) = ((a)) + 0 = (a) = a$. $\blacksquare$
(c)
$\begin{align*}
(1)a & = (1)a + 0 = (1)a + ((a) + a) \tag{A4} \\
& = a(1) + ((a) + (a)) \tag{A1} \\
& = (a(1) + (a)) + (a) \tag{A2} \\
& = (a(1) + a \cdot 1) + (a) \tag{M3} \\
& = (a((1) + 1)) + (a) \tag{D} \\
& = (a(0) + (a) \tag{A4} \\
& = 0 + (a) \tag{M3} \\
& = (a) \,\blacksquare\tag{A3}
\end{align*}$
(d) Using the statement proved in part (c), with $a = (1)$, we have that $(1)(1) = (1)$. From part (b), we have that $(1) = 1$, and so $(1)(1) = 1$ $\blacksquare$.
1.1.2Question 2¶
Prove that if $a, b \in \mathbb{R}$, then
(a) $(a + b) = (a) + (b)$;
(b) $(a) \cdot (b) = a \cdot b$;
(c) $1/(a) = (1/a)$;
(d) $(a/b) = (a)/b$ if $b\neq 0$.
(a) $\begin{align*} (a + b) & = (1)(a + b) \tag{by 1 (c)} \\ & = (1)(a) + (1)b \tag{D} \\ & = (a) + (b) \tag{by 1 (c) again, used twice} \, \blacksquare \end{align*}$
(b) $\begin{align*} (a)\cdot (b) & = ((1)a) \cdot ((1)b) \tag{by 1 (c)} \\ & = ((1)\cdot(a(1))) \cdot (b) = ((1)\cdot ((1)a)) \cdot (b) \tag{by M2, applied twice} \\ & = (((1)(1)) \cdot a) \cdot b \tag{by M1} \\ & = (1 \cdot a) \cdot b \tag{by 1 (d)} \\ & = a \cdot b \,\blacksquare \tag{by M3} \end{align*}$
(c) $\begin{align*} 1/(a) & = (1/(a)) \cdot 1 \tag{by M3} \\ & = (1/(a)) \cdot (a \cdot (1/a)) \tag{by M4} \\ & = (1/(a)) \cdot ((a) \cdot ((1/a)) \tag{by part (b)} \\ & = ((1/(a)) \cdot (a)) \cdot ((1/a)) \tag{by M2} \\ & = 1 \cdot ((1/a)) \tag{by M4} \\ & = (1/a) \,\blacksquare \tag{by M3}\end{align*}$
(d) $\begin{align*} (a/b) = (1)\cdot (a/b) \tag{by 1 (c)} \\ & = (1) \cdot (a \cdot (1/b)) \tag{by the definition of division} \\ & = ((1) \cdot a) \cdot (1/b) \tag{by M2} \\ & = (a) \cdot (1/b) \tag{by 1 (c) again} \\ & = (a)/b \,\blacksquare \tag{by the definition of division} \end{align*}$
1.1.3Question 3¶
Solve the following equations, justifying each step:
(a) $2x + 5 = 8$;
(b) $x^2 = 2x$;
(c) $x^2  1 = 3$;
(d) $(x1)(x + 2) = 0$.
(a) $\begin{align*} 2x + 5  5 = 8  5 \tag{subtracting 5 from both sides} \\ 2x + 0 & = 3 \tag{from above} \\ 2x & = 3 \tag{by A3} \\ (1/2)(2x) & = (1/2)3 \tag{multiplying by 1/2 on both sides} \\ ((1/2)\cdot 2)\cdot x & = (3/2) \tag{by M2, and the definition of division} \\ 1 \cdot x & = (3/2) \tag{by M4} \\ \cdot x & = (3/2) \tag{by M3} \,\blacksquare \end{align*}$
(b) $\begin{align*} x^2 & = 2x \\ x \cdot x & = 2 x \tag{by the definition of exponents} \\ (x\cdot x)(1/x) & = (2x)\cdot (1/x) \tag{multiplying by 1/x on each side} \\ x \cdot (1 \cdot (1/x)) & = 2\cdot (x\cdot (1/x)) \tag{by M2} \\ x \cdot 1 & = 2 \cdot 1 \tag{by M4} \\ x & = 2 \, \blacksquare \tag{by M3} \end{align*}$
(c) $\begin{align*} (x^2  1) + 1 & = 3 + 1 \tag{adding 1 to each side} \\ x^2 + ((1) + 1) & = 4 \tag{by A2} \\ x^2 + 0 & = 4 \tag{by A4} \\ x^2 & = 4 \tag{by A3} \end{align*}$
Not sure how to use this to conclude that $x = \pm 2$. What are square roots???
(d) Since the product of $(x1)$ and $(x+2)$ is zero, we know that at least one of the factors is zero. If $x  1 = 0$, then adding 1 to both sides gives us $x = 1$. If $x + 2 = 0$, then subtracting 2 from both sides gives us $x = 2$. $\blacksquare$
1.1.4Question 4¶
If $a \in \mathbb{R}$ satisfies $a \cdot a = a$, prove that either $a = 0$ or $a = 1$.
First, we assume that $a \neq 0$. Then $a = 1 \cdot a = ((1/a) \cdot a) \cdot a = (1/a) \cdot (a \cdot a) = (1/a) \cdot a = 1$. So if $a \neq 0, a = 1$. Since $a = 0$ satisfies $a \cdot a = a$, as $0 \cdot 0 = 0$ by part (c) of theorem 2.1.2, then $a = 0$ is a possible solution; consequently, if $a \cdot a = a$, then either $a = 0$ or $a = 1$.
Not entirely sure if this is a valid proof.
1.1.5Question 5¶
If $a \neq 0$ and $b \neq 0$, show that $1 / (ab) = (1/a)(1/b)$.
I can't seem to formulate this proof in a way that doesn't require ((((()))))) and 9000 uses of M1 and M2 so I'm just going to give the answer in words. The idea is that $(1/a \cdot a) = (1/b \cdot b) = 1$, so you can multiply by either, then when you multiply those together, you get $((1/a) \cdot (1/b)) \cdot (ab)$ (after some manipulation) and then since $ab \cdot (1/(ab)) = 1$ you just get $(1/a)(1/b)$.
1.1.6Question 6¶
Use the argument in the proof of Theorem 2.1.4 to show that there does not exist a rational number $s$ such that $s^2 = 6$.
(For reference, the proof of Theorem 2.1.4 is the famous $\sqrt{2} \notin \mathbb{Q}$ proof, which proceeds by contradiction and uses even/odd properties.)
Proof by contradiction: we assume that there does exist a rational number $s$ such that $s^2 = 6$. So $s = p/q$, where $p, q \in \mathbb{Z}$ and $q \neq 0$. Let the ratio be written in its lowest form, such that $p$ and $q$ have no common factors other than 1. Since $s^2 = 6$, $p^2/q^2 = 6$ and so $p^2 = 6q^2 = 3 \cdot 2q^2$. $p^2$ must be even, since 2 is a factor. It follows that $p$ is even as well, since if $p$ were odd, then $p = (2m + 1), m \in \mathbb{Z}$ and so $p^2 = 4m^2 + 4m + 1$ which would also be odd. So since $p$ is even, it follows that $q$ must be odd, because otherwise $p$ and $q$ would have 2 as a common factor.
Now, since $p$ is even, we can write $p$ in the form $p = 2m$, where $m \in \mathbb{Z}$. $s^2 = 6$ tells us that $p^2/q^2 = (2m)^2/q^2 = 4m^2/q^2 = 6$. Multiplying by $(1/2)q^2$ on both sides, we have $2m^2 = 3q^2$, which indicates that $3q^2$ is even. Since 3 is odd, $q^2$ must be even in order for their product to be even. But $q^2$ can only be even if $q$ is even, as if $q$ were odd then $q^2$ would be the product of two odd numbers and would thus be odd. So $q$ must be even. But this is a contradiction to the conclusion that $q$ is odd, which was reached in the previous paragraph. Consequently, it must be that there does not exist a rational number $s$ such that $s^2 = 6$. $\blacksquare$
1.1.7Question 7¶
Use the argument in the proof of Theorem 2.1.4 to show that there does not exist a rational number $t$ such that $t^2 = 3$.
Proof by contradiction: we assume that there does exist a rational number $s$ such that $t^2 = 3$. So $t = p/q$, where $p, q \in \mathbb{Z}$ and $q \neq 0$. Let the ratio be written in lowest terms, such that $p$ and $q$ have no common factors other than 1. Since $s^2 = 3$, $p^2/q^2 = 3$ and so $p^2 = 3q^2$. Now, there are two possibilities: either $p^2$ is even, or $p^2$ is odd. If $p^2$ is even, then $q^2$ must also be even (if it were odd, then the product of $q^2$ and 3  both odd numbers  would also be odd, contradicting the premise that $p$ is even). However, if both $p^2$ and $q^2$ are even, then $p$ and $q$ must both be even as well, by the reasoning in the previous question. Consequently, $p$ and $q$ are both even, and so they share a factor of 2. But this contradicts the premise that $p$ and $q$ have no common factors other than 1. So $p^2$ cannot be even.
Now let's look at the case where $p^2$ is odd. For this to happen, $q^2$ must also be odd, otherwise the product of $q^2$ and 3 would be even. So $p$ and $q$ are both odd. We can write them as $p = 2m + 1$ and $q = 2n + 1$, $m, n \in \mathbb{Z}$. So $p^2 = 4m^2 + 4m + 1$ and $q^2 =4n^2 + 4n +1$. Substituting these into the equation $p^2 = 3q^2$, we have:
$$4m^2 + 4m + 1 = 3(4n^2 + 4n+1)$$
By performing some algebraic manipulations we can simplify this to:
$$2(m^2 + m) = 6(n^2 +1) + 1$$
On the left side of the equation, we have an even integer, as 2 is a factor. On the right side of the equation, we have an odd integer, as $6(n^2+1)$ is even due to 2 being a factor of 6. A number cannot be both even and odd  this is a contradiction. Consequently, it must be that there does not exist a rational number $s$ such that $t^2 = 3$. $\blacksquare$
1.1.8Question 8¶
(a) Show that if $x, y$ are rational numbers, then $x + y$ and $xy$ are rational numbers.
(b) Prove that if $x$ is a rational number and $y$ is an irrational number, then $x + y$ is an irrational number. If, in addition, $x \neq 0$, then show that $xy$ is an irrational number.
(a) Let $x = p_1/q_1$ and $y = p_2/q_2$, where $p_1, p_2, q_1, q_2 \in \mathbb{Z}$ and $q_1, q_2 \neq 0$. Then $x = (p_1/q_1)\cdot 1 = (p_1/q_1)(q_2/q_2) = (p_1q_2)/(q_1q_2)$ (skipping some steps, and using some properties proved in previous exercises). Similarly, $y = (p_2q_1)/(q_2q_1)$. Then, $x + y = (p_2q_1 + p_1q_2)/(q_1q_2)$ (don't know if we're allowed to just do this?), where both the denominator and the numerator are integers (and the denominator is nonzero). So it's rational. For $xy$, the argument is similar.
(b) I think this was mentioned in class. Later.
1.1.9Question 9¶
Let $K = \{ s + t \sqrt{2}: s, t \in \mathbb{Q} \}$. Show that $K$ satisfies the following:
(a) If $x_1$, $x_2 \in K$, then $x_1 + x_2 \in K$ and $x_1 x_2 \in K$.
(b) If $x \neq 0$ and $x \in K$, then $1/x \in K$.
(a) $x_1 = s_1 + t_1 \sqrt{2}$. $x_2 = s_2 + t_2 \sqrt{2}$. We can write their sum as follows: $x_1 + x_2 = (s_1 + t_1 \sqrt{2}) + (s_2 + t_2 \sqrt{2}) = (s_1 + s_2) + (t_1 + t_2)\sqrt{2} \in K$. Also, we can write their product as $x_1x_2 = (s_1 + t_1 \sqrt{2})(s_2 + t_2 \sqrt{2}) = s_1s_2 + s_1t_2\sqrt{2} + t_1s_2\sqrt{2} + t_1t_2\sqrt{2}^2 = (s_1s_2 + 2t_1t_2) + (s_1t_1 + t_1s_2)\sqrt{2} \in K$.
(b) Don't know
1.1.10Question 10¶
(a) If $a < b$ and $c \leq d$, prove that $a + c < b +d$.
(b) If $0 < a < b$ and $0 \leq c \leq d$, prove that $0 \leq ac \leq bd$.
(a) This is similar to (though more complicated than) something we did in the first lecture. $a < b$ means that $b  a \in \mathbb{P}$, and $c \leq d$ means that $d c \in \mathbb{P} \cup \{0\}$. From property (i) of $\mathbb{P}$, we know that $(b a) + (d c) \in \mathbb{P}$ (this assumes that $dc\neq 0$). Now we just need to perform some algebraic manipulations:
$\begin{align*} (b  a) + (d  c) & = ((b a) + d) c) \tag{by A2} \\ & = ((b + d)  a)  c \tag{by A1, A2} \\ & = (b + d) + (a  c) \tag{by A2} \\ & = (b + d)  (a + c) \tag{by something} \end{align*}$
Consequently, $(b + d)  (a + c) \in \mathbb{P}$ and so $(a + c) < (b + d)$.
In the case where $dc = 0$, then we can't use property (i) directly, but since $ba \in \mathbb{P}$ and $(b  a) = (b a) + 0 = (ba) + (dc)$, then $(b a ) + (dc) \in \mathbb{P}$ so the above still applies. I'm not actually sure if this extra step needs to be made explicit, but, whatever.
(b) Later
1.1.11Question 11¶
(a) Show that if $a > 0$, then $1/a > 0$ and $1 / (1/a) = a$.
(b) Show that if $a < b$, then $a < \frac{1}{2} (a + b) < b$.
(a) $a > 0$ means that $a \in \mathbb{P}$. By some axiom^{1}, we know that $1/a \in \mathbb{R}$. By the Trichotomy Property (for $\mathbb{P}$), there are three possibilities: either $1/a \in \mathbb{P}$; or, $(1/a)\in \mathbb{P}$; or, $1/a = 0$.
Now, the third case is clearly false, because $1/a \cdot a = 1$, by axiom M4. But if $1/a = 0$, then $1/a \cdot a = 0 \cdot a = 0$. So we have that $1 = 0$ which is not true, by axiom M3.
Let's look at the second case. If this is true, then $(1/a) \cdot a \in \mathbb{P}$ by the closure of $\mathbb{P}$ under multiplication. This simplifies to $1 \in \mathbb{P}$. But it was proved in class that $1 > 0$, and so $1 \in \mathbb{P}$, which means that it cannot be that $1 \in \mathbb{P}$. Thus, we've reached a contradiction, and this case is not valid.
So there's only one possibility left: that $1/a \in \mathbb{P}$. $\blacksquare$
To show that $1 / (1/a) = a$:
$\begin{align*} 1 / (1/a) & = (1 / (1/a)) \cdot 1 \tag{by M3} \\ & = (1/(1/a)) \cdot ((1/a) \cdot a) \tag{by M4} \\ & = ((1/(1/a)) \cdot (1/a)) \cdot a \tag{by M2} \\ & = 1 \cdot a \tag{by M4} \\ & = a \,\blacksquare \tag{by M3} \end{align*}$
(b) We know that $a < b$. Adding $a$ to both sides gives us $a + a < a + b$, i.e., $2a < a + b$. Dividing both sides by 2, we get $a < \frac{1}{2}(a+b)$. Additionally, if we add $b$ to both sides of the original inequality, we get $a + b < b + b$, and so $\frac{1}{2}(a+b) < b$. So then $a < \frac{1}{2}(a+b) < b$. $\blacksquare$
1.1.12Question 12¶
Let $a, b, c, d$ be numbers satisfying $0 < a < b$ and $c < d < 0$. Give an example where $ac < bd$, and one where $bd < ac$.
If $a = 3$, $b = 4$, $c = 5$ and $d = 3$, then $ac = 15$ and $bd = 12$, hence $15 < 12$ (so $ac < bd$).
If $a = 3$, $b = 10$, $c = 4$ and $d = 2$, then $ac = 12$ and $bd = 20$, hence $20 < 12$ (so $bd < ac$).
1.2Section 2.2¶
1.2.1Question 1¶
If $a, b \in \mathbb{R}$ and $b\neq 0$, show that
(a) $a = \sqrt{a^2}$;
(b) $a/b = a / b$.
(a) From theorem 2.2.2 (b), we have that $a^2 = a^2$. Taking the square root of both sides, we have that $\sqrt{a^2} = \sqrt{a^2}$ and so $a = \sqrt{a^2}$.
(b) From theorem 2.2.2 (a), we have that $ab = ab$ for all $a, b \in \mathbb{R}$. Since $a/b$ is equivalent to $a \cdot (1/b)$, then $a/b = a \cdot (1/b) = a \cdot 1/b$. But since $1/b = 1/b$, then $a/b = a \cdot 1/b = a / b$.
1.2.2Question 2¶
If $a, b \in \mathbb{R}$, show that $a + b = a + b$ if and only if $ab \geq 0$.
First we prove the leftwards implication (that if the statement holds, then $ab \geq 0$). Assume that $a + b = a + b$. There are 4 cases for the values of $a$ and $b$. Either $a$ and $b$ are both $\geq 0$, or $a < 0$ and $b \geq 0$, or $a \geq 0$ and $b < 0$, or $a$ and $b$ both are $< 0$. For the first case, if either is 0, then $ab = 0$; otherwise, both are $\in \mathbb{P}$, and so their product $ab$ is as well, which means that $ab \geq 0$. For the second case, $a + b = a + b = b  a \neq a + b$ for $a < 0$. Similarly for the third case. In the fourth case, since both are negative, their product is positive (since $a, b \in \mathbb{P}$, and so their product, $(a)(b) \in \mathbb{P}$, and from exercise 2 (b) in section 2.1 we have that $(a)(b) = ab$), which means that $ab > 0$ (and consequently $ab \geq 0$). (It doesn't actually matter if the statement holds or not, just that it's false when the inequality is  material implication!)
Now we prove the rightward implication. If $ab \geq 0$, then either $ab > 0$ or $ab = 0$. In the former case, then either $a > 0$ and $b > 0$ or $a < 0$ and $b < 0$ (from 2.1.10). In the latter case, either $a = 0$ in which case the statement simplifies to $0 + b = b$ on the left side and $0 + b = 0 + b = b$ on the right side, which is trivially true, or $b=0$ in which case it simplifies to $a = a$ which is again trivially true. If $a, b > 0$, then $a + b > 0$ as well (by 2.1.5 (i)), and so $a+b = a + b$. Also, $a = a$ and $b = b$, so we hvae $a + b$ on the left and $a + b$ on the right, which proves that the statement is true. However, if $a, b <0$, then the right side simplifies to $a  b = (a + b)$. We magically realise^{2} that $a + b < 0$, which means that $a + b = (a + b)$. So the left and right sides match up, which means that the statement holds, and so everything is proved. $\blacksquare$
1.2.3Question 3¶
If $x, y, z \in \mathbb{R}$ and $x \leq z$, show that $x \leq y \leq z$ if and only if $x  y + y z  = x z$. Interpret this geometrically.
Probably want to use triangle inequality for this. Skipping.
1.2.4Question 4¶
Show that $\lvert x  a\rvert < \varepsilon$ if and only if $a  \varepsilon < x < a + \varepsilon$.
$xa < \epsilon$ means that $\epsilon < xa < \epsilon$. Adding $a$ to each term gives us $a\epsilon < x < a + \epsilon$. That was nice.
1.2.5Question 5¶
If $a < x < b$ and $a < y < b$, show that $xy < ba$. Interpret this geometrically.
Just need to show that $(ba) < xy < ba$. Well, $a  y < x  y < b  y$. Also, $a  x < y  x < b  x$. So $xa > xy > xb$, i.e., $xb < xy < xa$. Adding the first and last inequalities together gives us $ab + (x  y) < 2(xy) < ba + (xy)$. Subtracting $xy$ from each term gives us $ab < xy < ba$ which is what we wanted (since $(ba) = ab$).
1.2.6Question 6¶
Find all $x \in \mathbb R$ that satisfy the following inequalities.
(a) $4x5 \leq 13$
(b) $x^21 \leq 3$
(a) We need to solve $13 \leq 4x5 \leq 13$. Well, if $x = 4.5$, then $4x5 = 13$, and if $x = 2$, then $4x5 = 13$. So $2 \leq x \leq 4.5$ works.
(b) We can factor that as $(x1)(x+1) \leq 3$. So $3 \leq (x1)(x+1) \leq 3$. Well, if $x \leq 2$, then we have $x+1 \leq 3$ and $x1 \leq 1$, so that works for the right inequality. And if $x \geq 2$, then $x 1 \geq 3$ and $x + 1 \geq 1$, so $(x1)(x+1) \leq 3$. So $2 \leq x \leq 2$ works.
1.2.7Question 7¶
Skipping
1.2.8Question 8¶
Skipping
1.2.9Question 9¶
Skipping
1.2.10Question 10¶
Skipping
1.2.11Question 11¶
Skipping
1.2.12Question 12¶
Skipping
1.2.13Question 13¶
Skipping
1.2.14Question 16¶
Skipping
1.2.15Question 17¶
Skipping
1.3Section 2.3¶
1.3.1Question 1¶
Let $S_1 = \{x \in \mathbb R: x \geq 0\}$. Show in detail that the set $S_1$ has lower bounds, but no upper bounds. Show that $\inf S_1 = 0$.
No upper bound by the Archimedean property. 0 is a lower bound, and if $w$ is any lower bound, we know that $w \leq 0$ because 0 is in the set. Thus the infimum is 0.
1.3.2Question 2¶
Skip
1.3.3Question 3¶
Let $S_3 = \{1/n: n\in \mathbb N\}$. Show that $\sup S_3 = 1$ and $\inf S_3 \geq 0$.
Coming soon
1.3.4Question 4¶
Let $S_4 = \{1(1)^n/n:n \in \mathbb N\}$. Find $\inf S_4$ and $\sup S_4$.
First few terms: $1(1)/1 = 2$, $1  (1)/2 = 1/2$, $1  (1)/3 = 4/3$, $1  (1)/4 = 3/4$. So the inf is $1/2$, the sup is 2.
1.3.5Question 5¶
Skip
1.3.6Question 6¶
Skip
1.3.7Question 7¶
Skip
1.3.8Question 8¶
Skip
1.3.9Question 9¶
Skip
1.3.10Question 10¶
Skip
1.3.11Question 11¶
Skip
1.3.12Question 12¶
Skip
1.3.13Question 13¶
Skip
1.3.14Question 14¶
Sigh
1.4Section 2.4¶
1.4.1Question 1¶
Show that $\sup\{1  \frac{1}{n}:n \in \mathbb N\} = 1$.
First, we show that 1 is an upper bound: since $\frac{1}{n} > 0$ for $n > 0$, then $1\frac{1}{n} < 1$. So yeah, 1 is an upper bound. Now we need to show that if $v < 1$, then there exists some in $s \in S$ such that $s > v$. Let's write $v$ as $1  \epsilon$ for some $\epsilon > 0$. Well, by the Archimedean property, we know that there exists $m \in \mathbb N$ such that $\frac{1}{m} < \epsilon$. So then $s = 1  \frac{1}{m} > 1 \epsilon = v$. So then there exists $s \in S$ such that $s > v$, proving that nothing less than 1 is an upper bound. We conclude that 1 is the supremum. $\blacksquare$
This is probably not standard procedure but it seems to work. Also, $\epsilon$!! <3
1.4.2Question 2¶
If $S = \{1/n  1/m: n,m \in \mathbb N\}$, find $\inf S$ and $\sup S$.
inf: 1. sup: 1.
1.4.3Question 3¶
Skipping
1.4.4Question 4¶
Skipping for now
1.4.5Question 5¶
Skipping
1.4.6Question 6¶
Skipping
1.4.7Question 7¶
Skipping
1.4.8Question 8¶
Skipping
1.4.9Question 13¶
Skipping
1.4.10Question 14¶
Skipping
1.4.11Question 15¶
Skipping
1.4.12Question 16¶
Skipping
1.4.13Question 17¶
Skipping
1.4.14Question 18¶
Skipping
1.4.15Question 19¶
Skipping
1.5Section 2.5¶
1.5.1Question 1¶
If $I = [a, b]$ and $I' = [a', b']$ are closed intervals in $\mathbb{R}$, show that $I \subseteq I'$ if and only if $a' \leq a$ and $b \leq b'$.
First, we show that $I \subseteq I'$ implies that $a' \leq a$ and $b \leq b'$. Let $x \in I$. Then, from the set definition of an interval, we have that $a \leq x \leq b$. Since we also have that $x \in I'$, then $a' \leq x \leq b'$. Clearly, $a \in I$, and also $b \in I$. So $a' \leq a \leq b'$ and $a' \leq b \leq b'$. From this we can conclude that $a' \leq a$ and $b \leq b'$. $\blacksquare$.
Now, we show that if $a' \leq a$ and $b \leq b'$, then $I \subseteq I'$. Let $x \in I$. From the set definition of $I$, we know that $a \leq x \leq b$. Since $a' \leq a$ and $a \leq x$, then $a' \leq x$ by transitivity. Similarly we have that $x \leq b'$. Putting that together, we get that $a' \leq x \leq b'$, and so $x \in I'$. $\blacksquare$
1.5.2Question 2¶
If $S \subseteq \mathbb{R}$ is nonempty, show that $S$ is bounded if and only if there exists a closed bounded interval $I$ such that $S \subseteq I$.
First, we show that $S$ being bounded implies that there exists a closed bounded interval $I$ such that $S \subseteq I$. Well, if $S$ is bounded, then it has an infimum and supremum. We let $a = \inf S$ and $b = \sup S$, and we create an interval $I = [a, b]$. Then, if $x \in S$, by the definition of infima and suprema we have that $a \leq x \leq b$. So $x \in I$, by the set definition of the interval. $\blacksquare$
Now, we show that if there exists a closed bounded interval $I$ such that $S \subseteq I$, then $S$ is bounded. Let $a$ be the upper bound of $I$ and let $b$ be the lower bound of some interval $I$ satisfying this property. We can write $I$ as $\{x \in \mathbb{R}: a \leq x \leq b\}$. Since $S \subseteq I$, then for any $s \in S$, we have that $a \leq s \leq b$. $a$ is thus a lower bound of $S$, and $b$ is a lower bound. Consequently, $S$ is bounded. $\blacksquare$
1.5.3Question 3¶
If $S \in \mathbb{R}$ is a nonempty bounded set, and $I_S = [ \inf S, \sup S]$, show that $S \subseteq I_S$. Moreover, if $J$ is any closed bounded interval containing $S$, show that $I_S \subseteq J$.
Not very interesting (fairly trivial, and similar to previous questions)
1.5.4Question 4¶
In the proof of Case (ii) of Theorem 2.5.1, explain why $x, y$ exist in $S$.
Wow, asking us to answer a "(Why?)". Okay. Well, since $z < b$, then there always exists a $y$ such that $y \geq z$ (from the supremum definition). Also, since $S$ is not bounded below, there is always an $x$ such that $x \leq z$. Is that enough
1.5.5Question 5¶
Write out the details of the proof of case (iv) in Theorem 2.5.1.
Seriously? This is a question? That's one way to write a textbook, I guess.
In any case, if $S$ is not bounded above or below, I don't even care
1.5.6Question 6¶
If $I_1 \supseteq I_2 \supseteq \ldots \supseteq I_n \supseteq \ldots$ is a nested sequence of intervals and if $I_n = [a_n, b_n]$, show that $a_1 \leq a_2 \leq \ldots \leq a_n \leq \ldots$ and $b_1 \geq b_2 \geq \ldots \geq b_n \geq \ldots$.
I can't even pretend to care
1.5.7Question 7¶
Let $I_n = [0, 1/n]$ for $n \in \mathbb{N}$. Prove that $\displaystyle \bigcap_{n=1}^{\infty} I_n = \{0\}$.
Let $\displaystyle A = \bigcap_{n=1}^{\infty} I_n$. Clearly $0 \in I_n$ for every $n$, hence $0 \in A$. Suppose $x \in A$. Then $x \in [0, 1/n)$ for all $n \in \mathbb{N}$. So $x \leq 1/n$ for all $n$. Hence $x \leq 0$ by the Archimedean property (why? seriously, I'm not sure). Thus $x = 0$.
This is taken almost verbatim from the solutions to assignment 1, question 8 (b) (part two). See MyCourses for the solutions.
1.5.8Question 8¶
Let $J_n = (0, 1/n)$ for $n \in \mathbb{N}$. Prove that $\displaystyle \bigcap_{n=1}^{\infty} J_n = \varnothing$.
By the Archimedean property, the only $x \in \mathbb{R}$ such that $x < 1/n$ for all $n$ is 0. So only 0 could be in the intersection. But 0 is not in the intersection as it's an open set. So the intersection is empty.
1.5.9Question 9¶
Let $K_n = (n, \infty)$ for $n \in \mathbb{N}$. Prove that $\displaystyle \bigcap_{n=1}^{\infty} K_n = \varnothing$.
Pretty boring
1.5.10Question 10¶
skipping
1.5.11Question 11¶
skipping
1.5.12Question 12¶
Give the binary representations of $\frac{3}{8}$ and $\frac{7}{16}$.
Only not skipping because it's so easy:
$$\frac{3}{8} = 0.011_2 \qquad \frac{7}{16} = 0.0111_2$$
1.5.13Question 13¶
(a) Give the first four digits in the binary representation of $\frac{1}{3}$.
(b) Give the complete binary representation of $\frac{1}{3}$.
(a) $0.0101$ (draw the diagram and you'll see why)
(b) $0.\bar{01}$
2Section 3¶
2.1Section 3.1¶
2.1.1Question 1¶
The sequence $(x_n)$ is defined by the following formulas for the $n$th term. Write the first five terms in each case:
(a) $x_n = 1 + (1)^n$,
(b) $x_n = (1)^n/n$,
(c) $\displaystyle x_n = \frac{1}{n(n+1)}$,
(d) $\displaystyle x_n = \frac{1}{n^2+2}$.
(a) $(0, 2, 0, 2, 0)$
(b) $(1, 1/2, 1/3, 1/4, 1/5)$
(c) $(1/2, 1/6, 1/12, 1/20, 1/30)$
(d) $(1/3, 1/6, 1/11, 1/18, 1/27)$
2.1.2Question 2¶
The first few terms of a sequence $(x_n)$ are given below. Assuming that the "natural pattern" indicated by these terms persists, give a formula for the $n$th term $x_n$.
(a) $5, 7, 9, 11, \ldots$,
(b) $/1/2, 1/4, 1/8, 1/16, \ldots$,
(c) $1/2, 2/3, 3/4, 4/5, \ldots$,
(d) $1, 4, 9, 16, \ldots$.
(a) $3 + 2n$
(b) $(1)^{n+1}/2^n$
(c) $n/(n+1)$
(d) $n^2$
2.1.3Question 3¶
List the first five terms of the following inductively defined sequences.
(a) 1, 4, 13, 40, 121
(b) 3/2, 17/12. 577/408, etc
(c) 1, 2, 3, 5, 4
(d) 8, 13, 21, 34, 55
2.1.4Question 4¶
For any $b \in \mathbb{R}$, prove that $\lim(n/n) = 0$.
See Example 3.1.6 (a), only multiply $1/K$ by $b$, let $\epsilon' = b\epsilon$, etc.
2.1.5Question 5¶
Use the definition of the limit of a sequence to establish the following limits.
(a) $\displaystyle \lim\left (\frac{n}{n^2+1} \right ) = 0$,
(b) $\displaystyle \lim\left (\frac{2n}{n+1} \right ) = 2$,
(c) $\displaystyle \lim\left (\frac{3n+1}{2n+5} \right ) = \frac{3}{2}$,
(d) $\displaystyle \lim\left (\frac{n^21}{2n^2+3} \right ) = \frac{1}{2}$,
DON'T SKIP THIS. IT LOOKS USEFUL.
2.1.6Question 6¶
Show that
(a) $\displaystyle \lim\left (\frac{1}{\sqrt{n+7}} \right ) = 0$,
(b) $\displaystyle \lim\left (\frac{2n}{n+2} \right ) = 2$,
(c) $\displaystyle \lim\left (\frac{\sqrt{n}}{n+1} \right ) = 0$,
(d) $\displaystyle \lim\left (\frac{(1)^n n}{n^2+1} \right ) = 0$,
SAME AS ABOVE.
2.1.7Question 7¶
Skipping
2.1.8Question 8¶
Skipping
2.1.9Question 9¶
Skipping
2.1.10Question 10¶
Everything sucks
2.1.11Question 11¶
Idk
2.1.12Question 12¶
Idk
2.1.13Question 13¶
Idk
2.1.14Question 14¶
Show that $\lim((2n)^{1/n}) = 1$.
I give up.
2.1.15Question 15¶
Show that $\lim(n^2/n!) = 0$.
Might as well write the questions out since I'll have to do them one day
2.1.16Question 16¶
I think I have the wrong version of the textbook. My question numbers don't agree.
2.1.17Question 17¶
What is a limit? Seriously, how do you prove shit
2.1.18Question 18¶
sigh
2.2Section 3.2¶
2.2.1Question 1¶
Converge/diverge?
(a) $x_n = n/(n+1)$
(b) $x_n = (1)^nn/(n+1)$
(c) $x_n = n^2/(n+1)$
(d) $x_n = (2n^2+ 3)/(n^2+1)$
(a) Converges to 1. Proof: ?
(b) I think it diverges. Proof: ?
(c) Diverges. Proof: ?
(d) Converges to 2. Proof: ?
2.2.2Question 2¶
2.2.3Question 3¶
2.2.4Question 4¶
2.2.5Question 5¶
2.2.6Question 6¶
2.2.7Question 7¶
2.2.8Question 8¶
2.2.9Question 9¶
2.2.10Question 10¶
2.2.11Question 11¶
2.2.12Question 12¶
2.2.13Question 13¶
2.2.14Question 14¶
2.2.15Question 15¶
2.2.16Question 16¶
2.2.17Question 17¶
2.2.18Question 18¶
2.2.19Question 19¶
2.2.20Question 20¶
2.2.21Question 21¶
2.2.22Question 22¶
2.2.23Question 23¶
2.3Section 3.3¶
2.3.1Question 1¶
Let $x_1 = 8$ and $x_{n+1} = \frac{1}{2}x_n + 2$ for $n \in \mathbb{N}$. Show that $(x_n)$ is bounded and monotone. Find the limit.
In any problem like this, with inductivelydefined sequences, we need to three things: show the sequence has a bound (upper if the sequence is increasing, and lower if it's decreasing), prove the sequence is increasing or decreasing, and find the limit (usually by invoking the property of sequences that if $x_n \rightarrow x$, the $m$tail of $x_n$ also converges to $x$.
Just by finding $x_2 = 6$, we see that the sequence is decreasing. Let's prove this with induction:
Base case: we've already shown $x_2 < x_1$.
Induction step: $x_{k+1} = \frac{1}{2}x_k + 2$. Our induction hypothesis is that for some $k \in \mathbb{N}, x_{k+1} < x_k$. Thus by the rules we know about inequalities, this implies $\frac{1}{2}x_{k+1} + 2 < \frac{1}{2}x_{k} + 2$. Thus we can invoke the I.H. in our induction step as follows:
$$ x_{k+1} = \frac{1}{2}x_k + 2 > \frac{1}{2}x_{k+1} = x_{k+2} $$
Thus $x_{k+1} > x_{k+2} \quad \forall k \in \mathbb{N}$, thus $(x_n)$ is decreasing. Since it's decreasing, we now need to show that the sequence is bounded below. Looking at the sequence definition, we can guess that the sequence is at least bounded below by $2$. This may not be the greatest lower bound (or the infimum of the set consisting of all $x_n$) but we just need to show any lower bound exists. So let's prove that 2 is a lower bound, once again with induction:
Base case: $x_1 = 8, 2 \leq 8 \quad \checkmark$
Induction step: $x_{k+1} = \frac{1}{2}x_k + 2$. Our Induction Hypothesis is that $x_k \geq 2 \quad \forall k \in \mathbb{N}$. Thus using the I.H.:
$$ x_{k+1} = \frac{1}{2}x_k + 2 \geq \frac{1}{2} \cdot 2 + 2 = 3 \implies 3 \geq 2$$
As the implication is true, we have proved the sequence is bounded below by 2. By the Monotone Convergence Theorem, we know the sequence converges as we've proven it's monotone and bounded. Now, finally, we need to find the limit. By 3.1.9 in the book, we know the tail of a sequence converges to the same thing as the sequence (as mentioned before). So if $x_n \rightarrow L$ then $x_{n+1} \rightarrow L$. So we can write:
$$ L = \frac{1}{2}L + 2 \implies L = 4 $$
And now we're done.
2.3.2Question 2¶
Let $x_1 > 1$ and $x_{n+1} = 2  \frac{1}{x_n}$ for $n \in \mathbb{N}$. Show that $(x_n)$ is bounded and monotone. Find the limit.
This problem is similar to the one above, but there is some extra challenge. It's tougher to see if the sequence is increasing or decreasing, and because of the inequality, the base case is hard to prove. Solving for $x_2$ we get $x_2 > 1$, which doesn't tell us anything about the sequence's behavior. Let's do this a different way, by solving $x_2  x_1$. If the difference is positive, the sequence is (in the base case) increasing, and if it's negative, the sequence is decreasing. Our strategy is to use the fact that $x_1 > 1$ to make some inference about the difference.
$$ x_2  x_1 = 2  \frac{1}{x_1}  x_1 \implies \frac{1}{x_1}\left(x_1^2 + 2x_1  1\right) \implies \frac{1}{x_1}(x_1  1)^2 $$
As $(x_1  1)^2 > 0$ and since $x_1 > 1 \implies (1/x_1) < 0$ the entire expression must be negative. Therefore the base case implies the sequence is decreasing. Having done the base case, let's prove it for the rest of $\mathbb{N}$ using induction, as we did in the previous question:
$$ x_{k+1} = 2  \frac{1}{x_k} > 2  \frac{1}{x_{k+1}} = x_{k+2} $$
Thus $x_n > x_{n+1} \quad \forall n \in \mathbb{N}$. Note I wasn't as formal here about stating our use of the induction hypothesis, and I didn't explicitily show that $x_k > x_{k+1} \implies 2  \frac{1}{x_k} > 2  \frac{1}{x_{k+1}}$ (it just follows from the rules of inequalities from earlier in the course). A more formal treatment can be found in Question 1 above. When doing quizzes/tests, it's a good idea to completely rationalize each step.
Anyway, now we show there is a lower bound. As we know $2  \frac{1}{x_n}$ can't be less than 1, 1 seems like a good candidate for a lower bound. Proving by induction:
Base case: $x_1 > 1 \quad \checkmark$
Induction step: $x_{k+1} = 2  \frac{1}{x_k} \geq 2  \frac{1}{1} \implies 1 \geq 1 \quad \checkmark $.
Thus by the Monotone Convergence Theorem, $(x_n)$ converges. Using the property of $m$tails explained in Question 1:
$$ L = 2  \frac{1}{L} \implies L^2 = 2L1 \implies L = 1 $$
And we're done.
2.3.3Question 3¶
Let $x_1 \geq 2 1$ and $x_{n+1} = 1 + \sqrt{x_n1}$ for $n \in \mathbb{N}$. Show that $(x_n)$ is decreasing and bounded below by 2. Find the limit.
Because $x_1$ is defined with an inequality, this problem also requires the trick we used in Question 2. Let's see what we get when we take $x_2  x_1$:
$$ x_2  x_1 = 1 + \sqrt{x_1  1}  x_1 = \sqrt{x_1  1}  (x_1  1) = \sqrt{x_11}\left(1\sqrt{x_11}\right) $$
Since $x_1 \geq 2 \implies \sqrt{x_1  1} \geq 1$, we know $1  \sqrt{x_11} \leq 0$. Thus the whole expression is negative, and for the base case, the sequence is decreasing. Let's prove it for the rest of the natural numbers with induction. Having already done the base case, here's the induction step:
$$ x_{k+1} = 1 + \sqrt{x_k1} > 1 + \sqrt{x_{k+1}1} = x_{k+2} $$
Bam, easy. Just remember, when doing quizzes or tests, explain each step, like I did in Question 1. Now let's show the sequence is bounded below by 2, as the question asks.
Base case: $x_1 \geq 2 \quad \checkmark$
Induction step: $x_{k+1} = 1 + \sqrt{x_k  1} \geq 1 + \sqrt{21} = 2 \implies 2 \geq 2 \quad \checkmark$
Now for the limit, using the same method as in Questions 1 and 2 (rationalization for it is given in Question 1):
$$ L = 1 + \sqrt{L1} \implies (L1)^2 = L  1 \implies L^23L+2 = 0 $$
We get two roots, $L = 1, L = 2$. The limit must be 2 in this case, as the sequence is decreasing, so it will hit 2 before it hits 1.
2.3.4Question 4¶
Let $x_1 = 1$ and $x_{n+1} = \sqrt{2+x_n}$ for $n \in \mathbb{N}$. Show that $(x_n)$ converges and find the limit.
Same as Question 1, pretty much. There is no extra difficulty like in Questions 2 and 3. I know you can do the proofs for showing the sequence converges, but the limit part might be a bit tricky. As always, if $x_n \rightarrow L$, we can say:
$$ L = \sqrt{2+L} \implies L^2  L  2 = 0 \implies (L2)(L+1) = 0 $$
So we get two limits, $1$ and $2$. Since $x_n$ is defined by a square root, all terms of $x_n$ must be positive. Therefore a negative limit makes no sense, so the limit must be 2.
2.3.5Question 5¶
Let $y_1 = \sqrt{p}$, where $p > 0$, and $y_{n+1} = \sqrt{p+y_n}$ for $n \in \mathbb{N}$. Show that $(y_n)$ converges and find the limit. [Hint: One upper bound is $1 + 2\sqrt{p}$.]
Now this one looks fun  we have a variable in here! We want to show it converges, so if we show that the sequence is both monotone and bounded then we've accomplished that. So let's first show that the sequence is increasing (the hint sort of gives away the fact that it increases).
Base case: $y_2 = \sqrt{p+\sqrt{p}} > \sqrt{p+0} = \sqrt{p} = y_1 \quad \checkmark$.
Induction step: $y_{k+1} = \sqrt{p + y_k} < \sqrt{p+y_{k+1}} = y_{k+2} \quad \checkmark$
Now we need to show the sequence is bounded above. The question hints that an upper bound is $1+2\sqrt{p}$. The reason they give this particular bound is will become apparent when we do the induction step for the proof.
Base case: $y_1 = \sqrt{p} \leq 1 + 2\sqrt{p} \quad \checkmark$
Induction step: $y_{k+1} = \sqrt{p + y_k} < \sqrt{p + 1 + 2\sqrt{p}} = \sqrt{(\sqrt{p} + 1)^2} = \sqrt{p} + 1 \leq 1 + 2\sqrt{p} \quad \checkmark$
Now we know the sequence, let's find the limit:
$$ L = \sqrt{p+L} \implies L^2  L  p = 0 $$
Using our old middle school friend Mr. Quadratic Equation, we obtain solutions:
$$ L = \frac{1+\sqrt{1+4p}}{2}, L = \frac{1\sqrt{1+4p}}{2} $$
As the latter solution is negative, we can ignore it since the sequence is strictly positive. Thus the limit is:
$$ L = \frac{1+\sqrt{1+4p}}{2} $$
2.4Section 3.4¶
2.4.1Question 1¶
Consider the sequence $x_n = (1, 1/2, 3, 1/4 \ldots)$. This sequence is unbounded but the subsequence $x_{n+1}$ converges. It is easy to define piecewise sequences like this that satisfy the stated condition.
2.4.2Question 2¶
Use the method of Example 3.4.3(b) to show that if $0 < c < 1$, then $\lim(c^{1/n}) = 1$.
If we define $z_n := c^{1/n}$, then we can show that $z_n$ is monotone and use the Monotone Convergence Theorem to prove the sequence converges to some limit. First, we'll show that the sequence is increasing. Since $0 < c < 1$ we can say that:
$$ c = \frac{a}{b} \quad a, b \in \mathbb{R}, 1 < a < b $$
If we can show that $z_{n+1}  z_n$ is positive, then we know $z_n$ is increasing. Thus:
$$ z_{n+1}  z_n = c^{1/(n+1)}  c^{1/n} = \left(\frac{a}{b}\right)^{1/(n+1)}  \left(\frac{a}{b}\right)^{1/n} $$
As $\displaystyle x + \frac{1}{n} = \frac{1}{n+1} \implies x = \frac{1}{n(n+1)}$ we can continue with the above equation as follows:
$$ \left(\frac{a}{b}\right)^{\frac{1}{n(n+1)}} \cdot \left(\frac{a}{b}\right)^{\frac{1}{n}}  \left(\frac{a}{b}\right)^{\frac{1}{n}} = \left(\frac{a}{b}\right)^{\frac{1}{n}}\left[\left(\frac{a}{b}\right)^{\frac{1}{n(n+1)}}  1\right] = \left(\frac{a}{b}\right)^{\frac{1}{n}}\left[\left(\frac{b}{a}\right)^{\frac{1}{n(n+1)}}  1\right] $$
As the exponentiation of any positive number is positive, we know $\displaystyle\left(\frac{a}{b}\right)^{\frac{1}{n}} > 0$. By our definition of $a, b$ we know $b/a > 1$, so $(b/a)^{1/n(n+1)} > 1$. Thus the expression between the brackets is also positive, hence the entire expression is positive. Therefore $z_n$ is increasing.
Now we need to show there is an upper bound. It makes sense to choose 1, and we can prove it using the same definition of $c = a/b$. Since $c^{1/n} = \frac{a^{1/n}}{b^{1/n}}$ and $a^{1/n} < b^{1/n}$, thus $c^{1/n} < 1$.
So we now know that $z_n$ converges to some limit such that $z = \lim(z_n)$. By Theorem 3.4.2 it follows that $z = \lim(z_{2n})$. By the definition of $z_n$ we see that:
$$ z_{2n} = c^{\frac{1}{2n}} = \left(c^{\frac{1}{n}}\right)^{\frac{1}{2}} = \sqrt{z_n} $$
By Theorem 3.2.10, $z = \lim(z_{2n}) = \sqrt{\lim(z_n)} = \sqrt{z}$. Thus $z = \sqrt{z} \implies z = z^2$ which means $z$ is either 0 or 1. Since $z_n$ is increasing and greater than $0$ for all $n \in \mathbb{N}$ we deduce the limit is 1.
2.4.3Question 3¶
Let $(f_n)$ be the Fibonacci Sequence (see Example 3.1.2(d)). Let $x_n = \frac{f_{n+1}}{f_n}$. Given that $\lim_{x_n} = L$ exists, determine the value of $L$.
Notice that $f_{n+1} = f_n + f_{n1}$. Then we have
$$ x_n = \frac{f_{n+1}}{f_n} = \frac{f_{n} + f_{n1}}{f_n} = 1 + \frac{f_{n1}}{f_n} $$
Notice that $\displaystyle\frac{f_{n1}}{f_n} = (x_{n1})^{1}$. By Theorem <someone tell me what theorem to quote>, we get
$$ L = 1  L^{1} \Rightarrow L^2  L  1 = 0 $$.
This gives us two possible solutions. One is negative we do not need to consider it. This leaves us with
$$ \lim(x_n) = \lim\left(\frac{f_{n+1}}{f_n}\right) = \frac{1 + \sqrt{5}}{2} $$
2.4.4Question 4¶
Show that the following sequences are divergent.
$x_n = 1  (1)^n + 1/n$
Consider the sequence $ x_{2n} = 1/n$. $\lim(x_{2n}) = 0$. Now consider the sequence $x_{2n+1} = 2 + 1/n$. $\lim(x_{2n+1}) = 2$. Thus by theorem 3.4.5 $x_n$ is divergent.
$x_n = sin(\pi n/4)$
We know that $sin(\pi n/4) = sin(\pi n/4 + 2\pi) = sin(9n\pi/4)$ (at least you should probably know that). This is the subsequence $x_{9n}$, and it is the constant sequence $(\frac{1}{\sqrt{2}})$, the limit of which is of course $\frac{1}{\sqrt{2}}$. Also, $ sin(2\pi n) = sin(8\pi n /4)$ is the constant sequence $(0)$, with limit $0$. This is the subsequence $x_{8n}$. Since we have two subsequences with different limits, we can invoke Theorem 3.4.5 again to conclude that $x_n$ is divergent.
2.5Section 3.5¶
Later
2.6Section 3.6¶
Later

I don't really know which. Taken from the lecture notes for Tuesday, September 11, which I haven't typed up yet. ↩

Kind of like how once in a while, the textbook will present some step without justifying it and then enclose "Why?" in parentheses. Except in this case I don't actually know why, whereas I'm assuming the authors do. (Why don't they just tell us then???? (Why?)) In both cases, the "Why?" is left as an exercise for the reader ↩