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.
© BrainMass Inc. brainmass.com October 9, 2019, 4:01 pm ad1c9bdddfhttps://brainmass.com/math/recurrence-relation/solving-recurrence-relations-20093
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
http://www.mathnerds.com/mathnerds/best/chippingn/solution.asp
You might want to check it out, before looking at ...
Solution Summary
The two pages solution explains in detail how to build and solve the recurrence relations that describes the system.