0:00
/
Transcript

Sequences: Definition, Notation, Fibonacci, and Examples

The Fibonacci sequence is defined recursively by adding up the previous two terms.

YouTube - Summary - Notes - Playlist - Sequences and Series playlist

In this video I go over sequences, which are just ordered lists of numbers, the notation used to describe them, and several examples to illustrate how to obtain the general formula of the terms of a sequence. I also discuss briefly discuss the famous Fibonacci sequence, which is defined recursively by adding up the previous two terms. I will discuss Fibonacci sequences and the history behind it in great detail in later videos so stay tuned!

Timestamps:

  • Sequence is an ordered list whose domain is the set of positive integers: 0:00

  • Notation of a sequence {a_n}: 0:52

  • Example 1: Expanding out sequences from their formulas: 1:37

  • Exact trig ratios from equilateral triangle: 7:12

  • Example 2: Finding formula of a sequence: 11:25

  • Example 3: Sequences without simple defining equations: 15:19

  • Fibonacci sequence is defined recursively: 16:12

MES Links

Donate to MES

Discussion about this video

User's avatar

Ready for more?