Sequences
Introduction
- Sequences
- ordered lists of elements
- Sequence(์์ด)
- function from a subset of the integers to a set S
- Term(ํญ) of the Sequence
- denoting the image of the integer ๐
Geometric Progression(๋ฑ๋น์์ด)
- a: initial term (์ดํญ)
- r: common ratio (๊ณต๋น)
- a&&r: real numbers
Arithmetic Progression(๋ฑ์ฐจ์์ด)
- a: initial term (์ดํญ)
- d: common difference (๊ณต์ฐจ)
- a&&d: real numbers
Recurrence Relations(์ ํ์)
- an equation that expresses an in terms of one or more of the previous terms of the sequence
Solving Recurrence Relations
- Finding a closed formula for the nth term of sequence
- Method 1: Working upward
- forward substitution
- a2 -> a3 -> a4 -> โฆ -> an = solution
- Method 2: Working downward
- backward substitution
- an = an-1 + d = (an-2 +d) +d โฆ = a1 + d(n-1)
Fibonacci Sequence
-
Initial Conditions:
-
Recurrence Relation: