MA351 Homework 1
Due at 4:59pm in my mailbox in SAS 3151, Thursday, September 12, 2019
All solutions must be submitted in hardcopy
either to me in class or placed in my mailbox.
Note my office hours on my schedule.

Consider the sequence
g_{0} = 1,
g_{1} = 1,
g_{2} = 21,
g_{3} = 41,
g_{4} = 461,
g_{5} = 1281,
g_{6} = 10501,...
whose linear generator is g_{n+2} = g_{n+1} + 20g_{n},
that is, 20(!) pairs of baby rabbit offspring.
 As we did for the Fibonacci numbers, please derive a closed form expression for g_{n}.

Consider the sequence
h_{n} =
(–1)^{n} g_{n}:
1,–1,21,–41,461,–1281,10501,...
Please give a second order homogeneous linear recurrence with constant coefficients for h_{n} and
prove that your recurrence is correct for all n.

Consider the rdimensional de Bruijn digraph with 2^{r}
vertices and 2^{r+1} arcs.
Like in the hypercube, the vertices are strings of r bits.
There is an arc from each vertex
i_{1}, i_{2},..., i_{r}, where
i_{j} is either 0 or 1,
to the vertex
0, i_{1}, i_{2},..., i_{r1}
and an arc to the vertex
1, i_{1}, i_{2},..., i_{r1}
 Draw a nice picture of the digraph for r = 3.
 Prove that for r = 4 the digraph has the same
diameter as the 4 dimensional hypercube, that is, the maximum distance
between two vertices is 4. Your argument must both show
that between any two vertices there is a path of length
no more than 4, and that there exist two vertices whose
distance is at least 4.

Consider the 5dimensional hypercube as presented in class.
In class the vertices were the integers from 1 to 32.
The task is to relabel the vertices in the drawing as strings of 5 bits
(5bit binary numbers)
in such a way that the Hamming distance between
adjacent vertices is exactly one.