Purchase Solution

Solving a Recurrence Relation

Not what you're looking for?

Ask Custom Question

Solve the following recurrence relation:

a(n) = a(n-1) + 3(n-1), a(0) = 1

I know this should not be a difficult problem, but my main problem is in solving the problem when the coefficient of the a(n-1) term is 1. Also, when a summation is in the solution, I do not understand how to convert from a summation to a C(n,k) or a P(n,k). Could you please give a step by step explanation of the process involved with solving this type of problem? Thank you.

Purchase this Solution
Solution Summary

A recurrence relation is solved. The solution is detailed.

Solution Preview

a(1) = a(0) + 0 = 1

a(n) = a(n-1) + 3*(n-1).....
a(n) = a(n-2)+3*(n-2)+ 3*(n-1).....
a(n)= a(n-3) + 3*(n-3) + 3*(n-2) + 3*(n-1).....

and so on till u get a(1)...

So u will have:
a(n) = a(1) + 3*(1+2+3+4........+n-1)

Now sum of first k numbers is k(k+1)/2

with k=n-1 in this case.

so a(n) = 1 + [3*n(n-1)/2]

THIS IS THE SIMPLEST KIND OF RECURRENCE ...

Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Probability Quiz

Some questions on probability

View More Free Quizzes
Related BrainMass Solutions

  • solving the recurrence relation

    The solution is comprised of detailed explanations of solving the recurrence relation.

  • Solutions of Recurrence Relations

    of a recurrence relation are found.

  • Solving recurrence relations.

    20093 Solving recurrence relations. Find and solve a recurrence relation for the number of ways to make a pile of n chips using red, white, and blue chips and such that no two red chips are together.

  • General solution to a recurrence relation.

    Hence the general solution of the recurrence relation is given by Where are arbitrary constants. Expressing the solution can be rewritten as A general solution to a recurrence relation is found.

  • Using the Recurrence Relation in algebra

    538254 Using the Recurrence Relation in algebra Bob deposits quarters and dollar bills into a vending machine to buy snacks. Find a recurrence relation for the number of ways he can deposit 25*n cents into the machine if the order matters.

  • Recurrence relations, compound interest, polynomials, number of combinations, & iteration

    Write a recurrence relation and initial conditions for the membership fee n years after 1970 2.

  • Recursive and Recurrence

    True of False a_n = 2 is a solution to the recurrence relation a_n = 2a_n-1 - a_n-2 with initial conditions a_0 = 2 and a_1 = 2. a. True b. False 3.

  • Recurrence relation proof

    188496 Recurrence relation proof See attached The functions Tn(x), for n=0, 1, 2...satisfy the recurrence relation.... attached This is a proof by induction regarding functions that satisfy a given recurrence relation.

  • Recurrence Relation

    110996 Recurrence Relation in a Vending Machine A vending machine accepts only pennies and nickels. a) Find a recurrence relation for the number of ways to deposit n cents where the order in which coins are deposited matters.

View More Related Solutions