Square up to this

You are given a 100 by 201 Rectangular Chess Board. How many Squares of all sizes can you count?

Can you generalize for a n n by m m board ?


The answer is 848400.

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.

2 solutions

Satyen Nabar
May 29, 2015

Consider a n n by m m board where m = n + r m= n+r .

The number of 1 1 by 1 1 squares is n m n*m .

The number of 2 2 by 2 2 squares is ( n 1 ) ( m 1 ) (n-1)*(m-1)

The number of 3 3 by 3 3 squares is ( n 2 ) ( m 2 ) (n-2)*(m-2) and so on.

Thus the number of squares is the summation of n ( n + r ) n*(n+r) that is summation of n 2 + n r n^2 +nr where n has value from 1 1 to n n .

Summation of n 2 = n ( n + 1 ) ( 2 n + 1 ) 6 n^2= \dfrac{n(n+1)(2n+1)}{6}

Summation of r n = r n ( n + 1 ) 2 rn = \dfrac{rn(n+1)}{2}

The equation simplifies to n ( n + 1 ) ( 2 n + 1 + 3 r ) 6 \dfrac{n(n+1)(2n+1+3r)}{6}

Substitute n = 100 n=100 and r = 101 r=101 , The number of squares is 848400 848400

Murlidhar Sharma
Jun 4, 2015

The number of squares of side length 1 unit in a n n by m m board will be : n m n*m

The number of squares of side length 2 unit will be : ( n 1 ) ( m 1 ) (n-1)*(m-1)

The number of squares of side length 3 unit will be : ( n 2 ) ( m 2 ) (n-2)*(m-2)

So total number of square will be : i = 1 n ( n i ) ( m i ) \sum_{i=1}^n (n-i)*(m-i)

(Here I assume n n to less than m m )

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...