| Both sides previous revision
Previous revision
Next revision
|
Previous revision
|
math104-s22:s:jonathanwang [2022/01/31 21:44] 192.31.105.170 [Questions] |
math104-s22:s:jonathanwang [2026/02/21 14:41] (current) |
| |
| 1/27: {{ :math104-s22:s:jonathanwang:hw2.pdf |}} | 1/27: {{ :math104-s22:s:jonathanwang:hw2.pdf |}} |
| | |
| | 2/3: {{ :math104-s22:s:jonathanwang:hw3.pdf |}} |
| | |
| | 2/10: {{ :math104-s22:s:jonathanwang:hw4.pdf |}} |
| | |
| | 2/24: {{ :math104-s22:s:jonathanwang:hw5.pdf |}} |
| | |
| | 3/3: {{ :math104-s22:s:jonathanwang:hw6.pdf |}} |
| | |
| | 3/10: {{ :math104-s22:s:jonathanwang:hw7.pdf |}} |
| | |
| | 3/17: {{ :math104-s22:s:jonathanwang:hw8.pdf |}} |
| | |
| | 4/7: {{ :math104-s22:s:jonathanwang:hw9.pdf |}} |
| | |
| | 4/14: {{ :math104-s22:s:jonathanwang:hw10.pdf |}} |
| | |
| | 4/21: {{ :math104-s22:s:jonathanwang:hw11.pdf |}} |
| |
| ====== Questions ====== | ====== Questions ====== |
| For 11.2.ii, why does $s_{n_k}$ need to be greater than $\max\{s_{n_{k-1}}, k\}$ instead of just $s_{n_{k-1}}$? | 1. For 11.2.ii in Ross, why does $s_{n_k}$ need to be greater than $\max\{s_{n_{k-1}}, k\}$ instead of just $s_{n_{k-1}}$? |
| | |
| | 2. Why is 1(7) in [[https://courses.wikinana.org/_media/math104-f21/math_104-mt1.pdf]] false? I thought one could argue $|a_m - a_n| < \sum \tilde{\epsilon} < \epsilon$ |
| | |
| | 3. Why is 1(9) in [[https://courses.wikinana.org/_media/math104-f21/math_104-mt1.pdf]] false? |
| | |
| | 4. In Cantor's diagonalization argument, is the reason we can't take the sequence straight downwards because there may be repeated elements? |
| | |
| | 5. When Prof Zhou showed Cantor's diagonalization argument on 2/15, he produced a monotonically decreasing subsequence. However, I thought in general, although each sequence has a monotonic subsequence, it could be either increasing or decreasing. Thus, was the choice of monotonically decreasing just WLOG? |