play and relax: games for kids games
  Cut the knot: learn to enjoy mathematics
A math books store at a unique math study site. Learn to enjoy mathematics.
Google
Web CTK
Try our no ads browsing

Best sites for teachers
Sites for teachers
Sites for parents
Terms of use
Awards

Interactive Activities
CTK Exchange
CTK Insights - a blog

Games & Puzzles
What Is What
Arithmetic/Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Other Math sites
Front Page
Movie shortcuts
Personal info
Privacy Policy

Guest book
News sites

Recommend this site

Best sites for teachers
Sites for teachers
Sites for parents

Education & Parenting

Manifesto: what CTK is about Buying a book is a commitment to learning Table of content Try our no ads browsing Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page
Twenty five boys and twenty five girls sit around a table. Prove that it is always possible to find a person both of whose neighbors are girls.

Solution

Copyright © 1996-2008 Alexander Bogomolny

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Solution 1

For the sake of contradiction we assume that there is a sitting arrangement such that there is no one sitting between two girls. We call a block any group of same gender sandwiched between a pair of another gender. By our assumption, each girl block has at most 2 girls and there are at least 2 boys in the gap between two consecutive girl blocks. Hence there are at least [25/2]+1 = 13 girl blocks and at least 2×13 sitting in the gaps in-between the 13 girl blocks. But we only have 25 boys. A contradiction. Therefore our assumption was wrong and it is always possible to find someone sitting between two girls.

Solution 2

We again assume that there is a sitting arrangement such that there is no one sitting between two girls. We denote the positions a1, a2, ..., a50 so that position a50 is next to a1. Now we split the youngster into "odd" and "even" groups: (a1, a3, ..., a49) and (a2, a4, ..., a50) which we arrange around two smaller tables. Then, by our assumption, no girls are next to each other at either table. So at each table there are at most 12 girls for a total of at most 24 girls. A contradiction. Therefore our assumption was wrong and it is always possible to find someone sitting between two girls.

Reference

  1. T. Andreescu, Z. Feng, 102 Combinatorial Problems, Birkhäuser, 2003, p. 2

    Copyright © 1996-2008 Alexander Bogomolny

29713865Page copy protected against web site content infringement by Copyscape


Search:
Keywords:


Latest on CTK Exchange
try this puzzle ?/?? + ?/?? + ?/? ...
Posted by albert1950
2 messages
03:40 PM, Aug-26-08

Numbers raised to the power of 0
Posted by Chris Tolley
20 messages
12:17 PM, Aug-25-08

Arbelos : 1) Geometrical Construc ...
Posted by Sundar Krishnan
12 messages
06:29 AM, Aug-12-08

concerning pi
Posted by Lloyd Marks
4 messages
08:25 AM, Aug-22-08

Triangles With Equal Area
Posted by Bui Quang Tuan
5 messages
07:20 PM, Aug-26-08

Coxeter Introduction to Geometry
Posted by WiZaRd
1 messages
09:15 AM, Aug-23-08

site questions
Posted by madisonv
2 messages
04:24 PM, Aug-26-08