Playful problems with patterns
Richard F. Talbot, B. L. Burrows · International Journal of Mathematical Education in Science and Technology · 1984
In this paper a combinatorial problem is solved in three different ways. The first method considers a graph theoretic approach together with a special form of matrix multiplication. This leads naturally to the second and related method which uses conventional matrix multiplication. Finally, a direct approach is employed to obtain the 1920 solutions.