Article View: bu.localpostings
Article #292Four simple puzzles( rec.puzzles)
From: Shantanu Desai
Date: Mon, 27 Dec 1999 00:00
Date: Mon, 27 Dec 1999 00:00
21 lines
1243 bytes
1243 bytes
X-Orig-MsgId: <848v1u$9up$1@news1.bu.edu> 1. Prove that the number of people in the world, at any given time, who have shaken hands with an odd numer of people (1,3,5,..) is even (0,2,4,..) 2. Prove that in a group of six people there exists either a) a group of three who dont know each other or b) a group of three who all know each other or c) both a and b. 3. prove that in a group of n people (n=1,2,3,..) there are atleast two people who are acquainted with the same number of people within the group 4. given 2n people (n=1,2,3,..) where each person knows atleast n-1 people show that there can be an arrangement of four people on a round table where each person does not know the person at his side but knows the person on the opposite side. happy puzzling!
Technical Details
Message-ID:
<848v21$aeb$1@news1.bu.edu>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailShow Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 1552e4,20020f379ce209ba,start
X-Google-Attributes: gid1552e4,public
From: Shantanu Desai <shantanu@bu.edu>
Subject: Four simple puzzles( rec.puzzles)
Date: 1999/12/27
Message-ID: <848v21$aeb$1@news1.bu.edu>
X-Deja-AN: 565479280
Organization: Boston University
X-Orig-Newsgrp: rec.puzzles
User-Agent: tin/1.4-19991113 ("No Labels") (UNIX) (AIX/4-2)
Newsgroups: bu.localpostings