Differences

This shows you the differences between two versions of the page.

--- math104-s22:s:ajitkadaveru:start [2022/02/15 07:37]
ajitkadaveru
+++ math104-s22:s:ajitkadaveru:start [2026/02/21 14:41] (current)
@@ Line 8: / Line 8: @@
 HW4:  {{ :math104-s22:s:ajitkadaveru:camscanner_02-14-2022_23.35.pdf |}}
+HW5: {{ :math104-s22:s:ajitkadaveru:camscanner_03-03-2022_11.02.pdf |}}
+HW6: {{ :math104-s22:s:ajitkadaveru:camscanner_03-09-2022_16.55.pdf |}}
+HW7: {{ :math104-s22:s:ajitkadaveru:camscanner_03-17-2022_10.58.pdf |}}
+HW8: {{ :math104-s22:s:ajitkadaveru:camscanner-03-30-2022-14.58.pdf |}}
+HW9: {{ :math104-s22:s:ajitkadaveru:camscanner-04-14-2022-15.53.pdf |}}
+HW10: {{ :math104-s22:s:ajitkadaveru:104hw10.pdf |}}
+HW11: {{ :math104-s22:s:ajitkadaveru:104hw11.pdf |}}
+Questions:
+. Is there a more systematic way of finding subsequential limits? For some of the homework problems, I just sort of guessed some subsequences and their limits and it was easy to tell, but I'd imagine its hard to do that for other sequences.
+. I'm a bit confused about the proof to show that cauchy implies convergence. How do we know what epsilon to choose so that we get a contradiction (here we chose (A-B)/3)
+. In lecture, we went over a lemma that limsup a_n = A then for all epsilon > 0, N > 0, there exists n > N such that |a_n - A| < epsilon, but isn't that true by definition. Why did we have to do a more formal proof of it?
+. I see the common approach in 104 problems as to take cases when something is finite or infinite. This can help a lot, but is there a general sort of problem where I can use this strategy? A lot of times I get stuck and don't know what to use.
+. Is there a specific strategy for dealing with logarithms. None of the series tests seem friendly to this function. Is it always like some clever comparison?

Lecture Notes

User Tools

Site Tools

Differences

Page Tools