Consider a regular chessboard. In how many ways can we select two distinct unit squares from it, such that they neither share an edge, nor a vertex?
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.
Can u explain how did u arrive directly at 7 times 7 for the diagonal case
Log in to reply
Consider the number of positions in which the bottom square could appear in such a configuration - 7 possible row positions and 7 possible column positions.
We can split this problem into 3 cases:
The first square is on a corner
The first square is on an edge (but not a corner)
The first square is in the middle (not an edge or corner)
There are 4 ways to choose a corner as the first square, and 60 ways to choose the second square afterwards. We can multiply the amounts together. 4 × 6 0 = 240
There are 24 squares on the edge which we can choose as the first square, and 58 squares to choose as the second square afterwards. 2 4 × 5 8 = 1392
There are 36 squares in the middle which we can choose as the first square, and 55 squares to choose as the second square. 3 6 × 5 5 = 1980
We can add the 3 numbers we have gotten together. 2 4 0 + 1 3 9 2 + 1 9 8 0 = 3612
However, 2 ! 1 of our 3612 ways to choose the two squares are repeats, since the order of the squares doesn't matter. Therefore, we must divide 3612 by 2!, which is just 2, to get a final answer of 1 8 0 6
Problem Loading...
Note Loading...
Set Loading...
The number of ways of selecting two squares that share a vertical edge is 8 × 7 = 5 6 . Similarly there are 56 ways of selecting two squares that share a horizontal edge. There are 7 × 7 = 4 9 ways of selecting two squares that share a vertex in a bottom-left to top-right configuration and similarly 49 ways that share a vertex in the top-left to bottom-right configuration.
Hence the desired answer is ( 2 6 4 ) − 2 ( 5 6 + 4 9 ) = 3 2 × 6 3 − 2 1 0 = 2 0 1 6 − 2 1 0 = 1 8 0 6 .