MathDB
Circular seating problem

Source: AHSME 1991 problem 15

October 22, 2011
AMC

Problem Statement

A circular table has exactly 60 chairs around it. There are NN people seated at this table in such a way that the next person to be seated must sit next to someone. The smallest possible value of NN is
<spanclass=latexbold>(A)</span> 15<spanclass=latexbold>(B)</span> 20<spanclass=latexbold>(C)</span> 30<spanclass=latexbold>(D)</span> 40<spanclass=latexbold>(E)</span> 58 <span class='latex-bold'>(A)</span>\ 15\qquad<span class='latex-bold'>(B)</span>\ 20\qquad<span class='latex-bold'>(C)</span>\ 30\qquad<span class='latex-bold'>(D)</span>\ 40\qquad<span class='latex-bold'>(E)</span>\ 58