![]() |
||
| The figure below depicts one possible solution to this problem. Since a square has 4 sides, the maximum number of matches that could be used for 40 squares is 4 x 40 or 160. Any arrangement that allows each of the forty squares to be composed from four matches is a solution to the problem. | ||
![]() |
||
| However,care must be taken not to create larger squares when the forty squares are constructed. The figure below is not a solution because more than 40 squares are present. | ||
![]() |
||
Matchstick Problems |
||
| © Charles F. Schmidt | ||