Discrete Mathematics
# Linear Recurrence Relations

A 'domino tiling' of a region of the plane is a way of covering it (and only it) completely by non-overlapping dominoes. For example: There's 1 domino tiling of a 2 by1 rectangle & 2 tilings of a 2 by 2 rectangle. (1 consisting of 2 horizontal dominoes & 1 containing of 2 vertical ones) How many domino tilings of a 2 by 10 rectangle are there?

Walter will end his workout once all of the plates have been moved off of the starting pole and are all on the same pole. Today, Walter is feeling lazy, so he wants to do this in as few moves as possible. What is the minimum number of moves that Walter must make in order to finish his workout?

**Details and assumptions**

If you are interested in stacking problems, you might want to look at This Robotic Arm Can Do Many Things, But Is Unable To Think For Itself

\[ \frac{\alpha_{2016}}{\beta_{672}}.\]

Define \(X_n=X_{n-1}+X_{n-2}\)

If \(X_1=5^5\) and \(X_2=5^6\)

Find \(\displaystyle \lim_{n\rightarrow \infty} \dfrac{X_{n+1}}{X_{n}}\)

×

Problem Loading...

Note Loading...

Set Loading...