Purchase Solution

Recurrence Relation: coloring 1xN chessboard with two colors

Not what you're looking for?

Ask Custom Question

Consider a 1-by-n chessboard. Suppose we color each square of the chessboard with one of the two colors - red and blue. Let h(n) be the number of coloring in which no two squares that are colored red are adjacent. Find a recurrence relation that h(n) satisfies.

Purchase this Solution

Solution Summary

Solution derives the recurrence relation explaining each step briefly.

Solution Preview

Since there are only two possibilities for coloring the first square - either blue or red.

If the first square is colored blue, then the number of ways to color n squares such that no two red squares are adjacent, will be ...

Purchase this Solution


Free BrainMass Quizzes
Solving quadratic inequalities

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

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.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts