# Solution

(related to Problem: Counting The Rectangles)

There are $1,296$ different rectangles in all, $204$ of which are squares, counting the square board itself as one, and $1,092$ rectangles that are not squares. The general formula is that a board of $n^2$ squares contains $$\frac{(n^2+n)^2 }{4}$$ rectangles, of which $$\frac{2n^3 + 3n^2 + n}6$$ are squares and $$\frac{3n^4 + 2n^3 - 3n^2 - 2n}{12}$$ are rectangles that are not squares. It is curious and interesting that the total number of rectangles is always the square of the triangular number whose side is $n.$

Github: non-Github:
@H-Dudeney

### References

#### Project Gutenberg

1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.