using recurrence relations, how many way can a 2 x n rectangular board be tiled using 1 x 2 pieces and 2 x 2 pieces? is the equation an=an-1+2an-2 correct? how can I find the actual value without using the initial conditions?
Added by Jessica M.
Step 1
Determine the number of ways to tile a 2xn rectangular board using 1x2 pieces and 2x2 pieces. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Madhur L and 60 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
In how many ways can a $2 \times n$ rectangular checkerboard be tiled using $1 \times 2$ and $2 \times 2$ pieces?
Advanced Counting Techniques
Solving Linear Recurrence Relations
a) Find a recurrence relation for the number of ways to completely cover a $2 \times n$ checkerboard with $1 \times 2$ dominoes. [Hint: Consider separately the coverings where the position in the top right corner of the checkerboard is covered by a domino positioned horizontally and where it is covered by a domino positioned vertically.] b) What are the initial conditions for the recurrence relation in part (a)? c) How many ways are there to completely cover a $2 \times$ 17 checkerboard with $1 \times 2$ dominoes?
Applications of Recurrence Relations
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD