Purchase Solution

# recursive relation

Not what you're looking for?

Let h(sub n) denote the number of ways to perfectly cover a 1 by n board with monominoes and dominoes in such a way that no two dominoes are consecutive. Find, but do not solve, a recurrence relation and initial conditions satisfied by h(sub n)

answer: h(subn)= h(subn-1)+h(subn-3), (n>=3) with h(sub0)=1 h(sub1)=1 h(sub2)=2

##### Solution Summary

The expert finds the recursive relation.

##### Solution Preview

We use "M" to represent monominoes and "D" to represent dominoes. We do not allow "DD" in each cover. Let be the number of ways to cover board. We have the ...

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Multiplying Complex Numbers

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

##### 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