Cross Junction

In the figure above with 9 squares, how many ways are there to select two squares which do not share an edge?


This problem is part of the set Countings .


The answer is 28.

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

Nihar Mahajan
Feb 13, 2015

If we want to choose 2 squares from these 9 squares without any restriction ,

It can be done by ( 9 2 ) \large {9 \choose 2} = 9 ! 7 ! × 2 ! \large \dfrac{9!}{7! \times 2!} = 9 × 8 2 \large \dfrac{9 \times 8}{2} = 36 \large 36 ways.

But now we will use complementation. We will subtract the ways we don't want the squares to be selected from the total.

Consider the vertical column. If we consider the squares sharing an edge as 1 unit , then there are 4 pairs of squares in vertical column from which 1 can be chosen in ( 4 1 ) = 4 \large {4 \choose 1} = 4 ways. ( A , B ) , ( B , E ) , ( E , H ) , ( H , I ) \large (A,B) , (B,E) , (E,H) , (H,I)

Similarly , also from horizontal row = ( 4 1 ) = 4 \large ={4 \choose 1} = 4 ways. ( C , D ) , ( D , E ) , ( E , F ) , ( F , G ) \large (C,D) , (D,E) , (E,F) , (F,G)

Hence , total ways = 36 4 4 = 28 \large = 36 - 4 - 4 = \boxed {28}

I don't really get the solution. What about: the subset {(D,H),(H,F),(F,B),(B,D)} ? They share a diagonal edge. If so, the solution should be 24 instead of 28?

Julien Mueller - 5 months, 1 week ago
Seba Zagal Rojas
Jan 29, 2017

Start at the first square of any row/column and count the squares that don't share edges with it, it's 7.

So: 4 7 = 28. 4 * 7 = 28.

That was frustratingly simple

Başar Görgün - 11 months, 1 week ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...