1. The problem statement, all variables and given/known data For n>14 such that n is an integer, prove that a square can be partitioned into n smaller squares... 2. Relevant equations None... 3. The attempt at a solution I was thinking this would be somewhat of an induction proof because we are working our way up to n. So far, I've found when n = 15, n = 17, but somehow n = 16 is eluding me at the moment. I'm just trying to see what it would look like if I were to do this visually, however my assumption is that this has to deal with modulo 3 in some form or another. How this works into a proof is also something that is eluding me. Any suggestions would be warmly welcomed!