Purchase Solution

Solving recurrence relations.

Not what you're looking for?

Ask Custom Question

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.

Purchase this Solution

Solution Summary

The two pages solution explains in detail how to build and solve the recurrence relations that describes the system.

Solution Preview

Hello and thank you for posting your question to Brainmass!
The solution is attached below in two files. the files are identical in content, only differ in format. The first is in MS Word XP Format, while the other is in Adobe pdf format. Therefore you can choose the format that is suitable to you.

A slightly different but very close problem is discussed at

You might want to check it out, before looking at ...

Purchase this Solution

Free BrainMass Quizzes
Solving quadratic inequalities

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

Exponential Expressions

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

Graphs and Functions

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

Probability Quiz

Some questions on probability

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.