Let $b_n$ be the number of tilings of a 1 \times n board by 1 \times 1 white tiles, 1 \times 2 blue tiles, and 1 \times 2 green tiles. Find $b_1$, $b_2$, $b_3$. Find a recurrence relation for $b_n$
Added by Julio B.
Close
Step 1
So b1 = 1. For b2, there are three possible tilings: Show more…
Show all steps
Your feedback will help us improve your experience
Brent Burkett and 75 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
Discrete Math - Recurrence Relation Problem 4) (3 points): We want to pave a 2 X n walkway using two types of tiles (See the picture below. Type A tile may be rotated to get different configurations). Let an be the number of such pavings. Find a1, a2, a3, and a4. (Hint: Finding a1, a2, a3 should be relatively easy by listing the different configurations. You may also find a4 by listing all different configurations; however, if you can write a recurrence relation to express a4 in terms of a1, a2, a3, it will reduce the work significantly and I recommend that you try that!)
Madhur L.
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?
find a recurrence relation for bn the number of ways to construct a 2 x 2 x n pillar out of 2 x 1 x 1 bricks. What are the initial conditions? discrete math
Sri K.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD