Use Math Induction to prove that any checkerboard with dimensions 2 x 3n can be completely covered by L-shaped trominoes for any integer n $\ge$ 1.
How do I go about proving a problem like this? I know the P(n) for this proof is the sentence "A checkerboard with dimensions 2 x 3n for any integer n $\ge$ 1. And I know P(1) is the basis, but how do I prove it fully? I honestly don't understand what we are trying to prove.