Our proof of Theorem 5 is based on derivation of some congruences for the
Fibonacci and the Lucas numbers. Benjamin and Rouse (see [2], Corollary 4)
chose a purely combinatorial approach to this problem using the number of
ways to tile a board with squares and dominoes.