Must be a popular lecturer

Suppose a lecture hall has a rectangular array of chairs with r r rows and c c columns. Suppose further that there are precisely 19 19 girls seated in each row and precisely 15 15 boys seated in each column.

If exactly 14 14 chairs are empty then find the minimum possible value of r × c . r \times c.

Details and Assumptions :

  • A maximum of one person per chair is allowed.
Image Credit: Wikimedia Hobiecat93


The answer is 1176.

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.

1 solution

Since there are 19 19 girls seated in each row there are 19 r 19r chairs occupied by girls, and since there are 15 15 boys seated in each column there are 15 c 15c chairs occupied by boys. There are a total of r c rc chairs in the lecture hall, so with 14 14 empty chairs we can form the equation

19 r + 15 c + 14 = r c 15 c + 14 = r ( c 19 ) 19r + 15c + 14 = rc \Longrightarrow 15c + 14 = r(c - 19)

r = 15 c + 14 c 19 = 15 c ( 15 ) ( 19 ) + ( 15 ) ( 19 ) + 14 c 19 = 15 + 299 c 19 . \Longrightarrow r = \dfrac{15c + 14}{c - 19} = \dfrac{15c - (15)(19) + (15)(19) + 14}{c - 19} = 15 + \dfrac{299}{c - 19}.

Now r r must be an integer so c 19 c - 19 must divide 299. 299. Since 299 = 13 23 , 299 = 13*23, we can have c 19 c - 19 equal 1 , 13 , 23 1, 13, 23 or 299. 299. This gives us four possible pairs ( c , r ) (c,r) , namely

( 20 , 314 ) , ( 32 , 38 ) , ( 42 , 28 ) , ( 318 , 16 ) . (20, 314), (32,38), (42,28), (318, 16).

The resulting products are 6280 , 1216 , 1176 , 5088 , 6280, 1216, 1176, 5088, respectively, and so the desired minimum of r × c r \times c is 1176 . \boxed{1176}.

The fourth possible value of ( c , r ) (c,r) will be ( 318 , 16 ) (318, 16) . I guess its a typo @Brian Charlesworth

Satyen Nabar - 6 years, 1 month ago

Log in to reply

Typos fixed, (better late than never). :) Thanks for catching them.

Brian Charlesworth - 6 years ago

Lovely problem though gets pretty straightforward after figuring out the equation.

Kunal Verma - 6 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...