Calculus II ep19: Sequences (Oct 26, 2026)
Watch on YouTube →
Overview
Sequences are ordered lists of numbers, described either by a general term such as a_n = 2n or by a recursive rule such as the Fibonacci recurrence. The lecture explores Fibonacci and look-and-say sequences, defines sequence limits with the epsilon-N condition, and applies familiar limit techniques, including dominant-power division, continuity, and L'Hôpital's rule.
Key takeaways
- A sequence is an ordered list, not a sum: a_n = 2n generates even positive integers when indexed from 1, while a series adds its terms.
- The recursive Fibonacci rule a_n = a_(n-1) + a_(n-2) requires prior terms, whereas Binet's formula uses the golden ratio and √5 to compute terms directly.
- A sequence converges to L precisely when every tolerance ε > 0 can be met by all terms beyond some index N: n > N implies |a_n - L| < ε.
- Many function-limit techniques transfer to sequences: continuity gives lim cos(1/n) = 1, and L'Hôpital's rule gives lim n/5^n = 0.
- For polynomial and radical expressions, compare effective powers of n; a term n^10 under a square root behaves like n^5 outside it.
- The sequence (-1)^n diverges because its terms keep alternating between -1 and 1 rather than approaching a single number.
Chapters
- A sequence is an infinite list of numbers, while a series is a sum of numbers.
- Examples include 2, 4, 6, 8, the powers of 2, the counting numbers, and the digits 8675309.
- A sequence can be mathematically patterned, but it does not need a neat formula to qualify.
- The general term a_n = 2n generates 2, 4, 6, 8 when n starts at 1; a_n = n generates the counting numbers.
- For a_n = 3 + 5n, starting at n = 1 gives 8, 13, 18, 23, while starting at n = 0 gives 3, 8, 13.
- Terms are the individual sequence values, and notation such as n = 0 to infinity makes the starting index explicit.
- For a_n = (-1)^n n, substituting n = 1, 2, 3, 4 gives -1, 2, -3, 4.
- The factor (-1)^n alternates signs, a pattern frequently used in sequences and series.
- Unlike integer powers in a sequence, (-1)^x is generally not real-valued for arbitrary real x, such as x = 0.5.
- The Fibonacci sequence begins 1, 1, 2, 3, 5, 8, 13, 21, with each term formed by adding the previous two.
- The sequence is named after Fibonacci, an Italian mathematician of the 1200s, though related mathematics existed earlier in Middle Eastern and Indian texts.
- Fibonacci helped introduce Hindu-Arabic numerals to Europe through a book explaining arithmetic with the place-value system, which is more practical for calculation than Roman numerals.
- The recursive rule a_n = a_(n-1) + a_(n-2) requires the two preceding terms, so finding a distant term means building earlier terms first.
- A closed-form expression, commonly called Binet's formula, uses powers of the golden ratio and √5 to calculate a Fibonacci term directly.
- The formula's radical components combine to produce whole-number Fibonacci values, including 8 at the sixth term.
- Each term describes the digits in the previous term: 1 becomes 11, then 21, then 1211, by reading runs and stating their counts and digits.
- John Conway studied the sequence's properties; from the seed 1, its terms grow and never contain the digit 4.
- The ratio of consecutive term lengths approaches about 1.303, Conway's constant, an algebraic number that is a root of a degree-71 polynomial.
- For a_n = 1/n, the terms approach 0 as n increases, so lim n→∞ a_n = 0.
- For a_n = (n-1)/n, the terms are 0, 1/2, 2/3, 3/4, and approach 1.
- A sequence limit concerns the terms as the index advances toward infinity; it is not a limit as n approaches a finite value.
- The statement lim n→∞ a_n = L means that for every ε > 0, there is an N such that n > N implies |a_n - L| < ε.
- The absolute value measures the distance between a_n and L, while the universal phrase “for every ε” requires the terms to meet any requested positive tolerance eventually.
- The formal definition emerged in the 1800s, long after calculus began, and is foundational in real analysis even though this course will mostly use computational techniques.
- A sequence converges when its limit is a real number; if no such number exists, it diverges.
- For 3 + 4n², the dominant n² term grows without bound, so the sequence diverges to infinity.
- For 8 - 10/n, the fraction tends to zero and the sequence converges to 8.
- The limit of n/5^n is evaluated as an infinity-over-infinity form using L'Hôpital's rule, giving 0.
- Continuity allows the limit to pass inside a function: cos(1/n) tends to cos(0) = 1.
- For rational expressions, divide through by the highest effective power of n to put variable terms into denominators.
- When a square root contains n^10, it contributes an effective n^5 outside the root, so the dominant-power comparison must account for the root.
- Two practice limits apply the dominant-power method, with the first expression's highest effective power identified as n^4.
- For terms inside a square root, dividing by n^4 outside corresponds to dividing the radicand by n^8.
- The exercise pause gives students time to simplify terms before taking the limit.
- The first exercise is divided through by n^4, the highest power outside the radical.
- After simplification, the n-dependent terms appear in denominators and tend to zero; the remaining numerator also evaluates to zero.
- The resulting limit is 0, not 5, the alternative answer some students initially suggested.
- The second exercise uses n^3 as the highest effective power, including the n^6 term under the square root.
- After division and cancellation, the terms with n in denominators vanish, leaving sin(π) over √4.
- The limit is 0, since sin(π) = 0; the calculation highlights evaluating the remaining constant expression carefully.
- The sequence (-1)^n alternates between -1 and 1, so its graph consists of isolated points rather than a continuous curve.
- Because the terms do not approach one single value, the sequence has no limit and diverges.
- Alternating-sign sequences require discrete reasoning rather than treating (-1)^n as the real-valued function (-1)^x.
Transcript excerpt
0:00 All right. Now I'm ready to talk about sequences and series. So um these these are not synonyms. The word sequence is different from series. Series is uh a sum of things. A sequence is just a bunch of numbers like one after another in a list. So we'll talk for today and probably next time also about sequences. Most of what we're going to discuss are is about series which is more complicated. But anyway, a sequence Sorry, my writing going to write this again. Sequence is just a um an infinite list of numbers one after another. All right. So, you know, here's a
0:49 sequence 2 4 6 8 dot dot dot. uh often times you know the sequence has some kind of a pattern to it and we just write sort of enough things to give you some idea of what the pattern is. Um anybody can anyone identify the pattern here. >> What is that two? >> Oh yeah. Each time is being multiplied by two from the previous one. Yeah. Any any other way to describe that? Actually that's correct. Although I was going to say it in a different way. You can say it in that way if you like. Uh I was going to say these are the powers of two which is also true. Right? That's two to the power zero and then uh
1:38 etc. If you continually multiply by two each time you will get the next power of two. All right. Here's uh everybody's favorite sequence. Even babies know that one. Uh that is just the ordinary numbers. Um these sequences all have sort of like um fairly obvious mathematical pattern to them but that's not required. A sequence can be just any list of numbers. It doesn't have to be sort of uh
This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.
Related notes
Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Prof Staecker.