Solve the following problemusing 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

Printable View

- Aug 14th 2011, 07:31 AMalexmahoneUsing induction
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