Question

(a) Let $f(n)$ count the number of different perfect covers of a 2 -by-n chessboard by dominoes. Evaluate $f(1), f(2), f(3), f(4)$, and $f(5)$. Try to find (and verify) a simple relation that the counting function $f$ satisfies. Use this relation to compute $f(12)$. (b) $*$ Let $g(n)$ be the number of different perfect covers of a 3 -by-n chessboard by dominoes. Evaluate $q(1), q(2) \ldots, g(6)$.

          (a) Let $f(n)$ count the number of different perfect covers of a 2 -by-n chessboard by dominoes. Evaluate $f(1), f(2), f(3), f(4)$, and $f(5)$. Try to find (and verify) a simple relation that the counting function $f$ satisfies. Use this relation to compute $f(12)$.
(b) $*$ Let $g(n)$ be the number of different perfect covers of a 3 -by-n chessboard by dominoes. Evaluate $q(1), q(2) \ldots, g(6)$.

Added by Brad S.

Elementary Statistics a Step by Step Approach

Allan G. Bluman 9th Edition

Instant Answer

Solved by Expert Dominador Tan

12/30/2023

Step 1

- $f(2)$: A 2-by-2 chessboard can be perfectly covered by dominoes in one way, so $f(2) = 1$. - $f(3)$: A 2-by-3 chessboard cannot be perfectly covered by dominoes, so $f(3) = 0$. - $f(4)$: A 2-by-4 chessboard can be perfectly covered by dominoes in three ways, so Show more…

Show all steps

Thanks for your feedback!

(a) Let $f(n)$ count the number of different perfect covers of a 2 -by-n chessboard by dominoes. Evaluate $f(1), f(2), f(3), f(4)$, and $f(5)$. Try to find (and verify) a simple relation that the counting function $f$ satisfies. Use this relation to compute $f(12)$. (b) $*$ Let $g(n)$ be the number of different perfect covers of a 3 -by-n chessboard by dominoes. Evaluate $g(1), g(2) ldots, g(6)$.