Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Word Prob HMK

    Uploaded by

    Michael Ward
    A recursive sequence is a sequence where each term is defined by preceding terms in the sequence. The Fibonacci sequence, where un=un-1+un-2, is provided as the classic example. Exercises are included to write out the first few terms of common recursive sequences like the Fibonacci sequence, and to define other sequences recursively or with explicit formulas.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Word Prob HMK

    Uploaded by

    Michael Ward
    7 views1 page
    A recursive sequence is a sequence where each term is defined by preceding terms in the sequence. The Fibonacci sequence, where un=un-1+un-2, is provided as the classic example. Exercises are included to write out the first few terms of common recursive sequences like the Fibonacci sequence, and to define other sequences recursively or with explicit formulas.

    Original Description:

    Original Title

    Untitled

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A recursive sequence is a sequence where each term is defined by preceding terms in the sequence. The Fibonacci sequence, where un=un-1+un-2, is provided as the classic example. Exercises are included to write out the first few terms of common recursive sequences like the Fibonacci sequence, and to define other sequences recursively or with explicit formulas.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    7 views1 page

    Word Prob HMK

    Uploaded by

    Michael Ward
    A recursive sequence is a sequence where each term is defined by preceding terms in the sequence. The Fibonacci sequence, where un=un-1+un-2, is provided as the classic example. Exercises are included to write out the first few terms of common recursive sequences like the Fibonacci sequence, and to define other sequences recursively or with explicit formulas.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    5.

    4 Recursive Sequences

    A recursive sequence is a sequence where every term is written in terms of previous terms.

    The Fibonacci Sequence is the most popular example of this. un=un-1+un-2 where u0=0, u1=1

    Ex 1 Write the first 5 terms of the Fibonacci Sequence.

    Recursive Sequences can be used to write arithmetic and geometric sequences.

    Ex 2 Write the following explicitly written sequences using a recursive formula

    a. 2, 5, 8, 11, … b. 2, -6, 18, -54, …

    Ex 3 Write the following recursive sequence with an explicit formula

    a. un = un-1 − 5 b. un = (−4)un-1

    Ex 4 Find u5 when un=2un-1 + 1, and u1 = 3

    Ex 5 Write a recursive sequence for 1, 2, 6, 24, 120, 720, ….

    Ex 6 Write a recursive sequence for 2, 3, 6, 18, 108, 1944, 209952, …

    Word Prob Hmk

    You might also like