Scribd Logo
Upload

Welcome to Scribd!

  • Tutorial Sheet-04 PDF

    Uploaded by

    Parekh Prashil Bhaveshbhai
    32 views1 page
    This document provides three questions about solving recurrence relations using generating functions and characteristic root methods. Question 1 asks to use generating functions to solve two recurrence relations, one with terms an, an-1, an-2 and the other with terms an, an-1, an. Question 2 asks to use the characteristic root method to solve three recurrence relations, all with different terms involving an, an-1, an-2 and exponential or polynomial terms. Initial conditions are provided for each recurrence relation.

    Original Description:

    Original Title

    Tutorial Sheet-04.pdf

    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
    This document provides three questions about solving recurrence relations using generating functions and characteristic root methods. Question 1 asks to use generating functions to solve two recurrence relations, one with terms an, an-1, an-2 and the other with terms an, an-1, an. Question 2 asks to use the characteristic root method to solve three recurrence relations, all with different terms involving an, an-1, an-2 and exponential or polynomial terms. Initial conditions are provided for each recurrence relation.

    Copyright:

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

    Tutorial Sheet-04 PDF

    Uploaded by

    Parekh Prashil Bhaveshbhai
    This document provides three questions about solving recurrence relations using generating functions and characteristic root methods. Question 1 asks to use generating functions to solve two recurrence relations, one with terms an, an-1, an-2 and the other with terms an, an-1, an. Question 2 asks to use the characteristic root method to solve three recurrence relations, all with different terms involving an, an-1, an-2 and exponential or polynomial terms. Initial conditions are provided for each recurrence relation.

    Copyright:

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

    Tutorial Sheet-04

    Q-1: Use the method of generating functions to solve the following


    recurrence relations:
    A. an + 3an – 1 – 4an – 2 = 0; n ≥ 2, given a0 = 3, a1 = –2.
    B. an + 2 – 5an + 1 + 6an = 36; n ≥ 0; given a0 = a1 = 0.
    Q-2: Use the characteristics root method to solve the following
    recurrence relations:
    A. an = 4an – 1 – 3an – 2 + 2^n + n + 3; n ≥ 2, given a0 = 1; and a1 = 4.
    B. an + 2 – 4an + 1 + 3an = 2^n . n^2 ; n ≥ 0; given a0 = a1 = 0.
    C. an + 2 – 7an + 1 – 8an = n(n – 1)2^n .

    You might also like