In permutations and combinations , one of the problems that appear frequently is asking for the total number of squares on 8 x 8 chessboards. Can you tell what the answer is?
As an extension, can you find a formula to count the number of squares in N x M rectangle ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
For any n × m rectangle
No. of squares = n . m + ( n − 1 ) ( m − 1 ) + ( n − 2 ) ( m − 2 ) + . . . . . . . . . . . . . . . . . upto when any one of the two terms in multiplication becomes zero