THIS STORY HAS BEEN FORMATTED FOR EASY PRINTING

Could you compete for the Green Chicken?

October 13, 2008

E-mail this article

Invalid E-mail address
Invalid E-mail address

Sending your article

Your article has been sent.

Text size +

1. A college dormitory has 250 students. For every pair of students, A and B, there is a language that A speaks that B does not, and a language that B speaks that A does not. What is the smallest total number of languages that could be known by the students? (Full article: 317 words)

This article is available in our archives:

Globe Subscribers

FREE for subscribers

Subscribers to the Boston Globe get unlimited access to our archives.

Not a subscriber?

Non-Subscribers

Purchase an electronic copy of the full article. Learn More

  • $9.95 1 month archives pass
  • $24.95 3 months archives pass
  • $74.95 1 year archives pass