Suppose a lecture hall has a rectangular array of chairs with rows and columns. Suppose further that there are precisely girls seated in each row and precisely boys seated in each column. (A maximum of one person per chair is allowed).
If exactly chairs are empty then find the minimum possible value of
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.
Since there are 1 7 girls seated in each row there are 1 7 r chairs occupied by girls, and since there are 1 4 boys seated in each column there are 1 4 c chairs occupied by boys. There are a total of r c chairs in the lecture hall, so with 9 empty chairs we can form the equation
1 7 r + 1 4 c + 9 = r c ⟹ 1 4 c + 9 = r ( c − 1 7 )
⟹ r = c − 1 7 1 4 c + 9 = c − 1 7 1 4 c − ( 1 4 ) ( 1 7 ) + ( 1 4 ) ( 1 7 ) + 9 = 1 4 + c − 1 7 2 4 7 .
Now r must be an integer, so c − 1 7 must divide 2 4 3 . Since 2 4 7 = 1 3 ∗ 1 9 , we can have c − 1 7 being 1 , 1 3 , 1 9 or 2 4 3 . This gives us four possible pairs ( c , r ) , namely
( 1 8 , 2 5 1 ) , ( 3 0 , 3 3 ) , ( 3 6 , 2 7 ) , ( 2 6 4 , 1 5 ) .
The resulting products are 4 5 1 8 , 9 9 0 , 9 7 2 , 3 9 6 0 , and so the desired minimum value of r ∗ c is 9 7 2 .