Solve the following problem using induction. Let n > 14 be an integer. Prove that a square can be partitioned into n smaller squares. Source: 'A Walk Through Combinatorics' by Miklos Bona
Follow Math Help Forum on Facebook and Google+