Emirhan wrote: A floor has $2 \times 11$ dimension, and this floor covering with $1 \times 2$ rectangles. (No two rectangles overlap). How many cases we done this job? the answer is $\phi(11)$ where $\phi(x)$ is Fibonacci's sequence's $x$-th member