Sequences

์ตœ๋Œ€ 1 ๋ถ„ ์†Œ์š”

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: แ„‹แ…กแ†ฏ แ„‰แ…ฎ แ„‹แ…ฅแ†นแ„‹แ…ณแ†ท

์นดํ…Œ๊ณ ๋ฆฌ:

์—…๋ฐ์ดํŠธ: