An Introduction To Problem Equivalence With Combinatorics

This paper proposes the use of several classes of simple combinatorial problems that share the same solution for teaching problem equivalence and recursion. Our focus is on counting problems that involve Fibonacci numbers. While these problems have simple recursive solutions, we propose that for teaching purposes - they can also be solved by finding other isomorphic problems for which the solution is known.