All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
Mutually friendly (Posted on 2002-07-01) Difficulty: 2 of 5
Prove that any group of six people contains either 3 mutual friends or 3 mutual strangers.

(For the purpose of this problem any pair of people must be either friends or strangers.)

See The Solution Submitted by levik    
Rating: 3.0000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: possible solution? | Comment 9 of 11 |
(In reply to possible solution? by calla tah-n)

also... forgot to add this lah...
if there are three groups...
say:
2-2-2 or 1-2-3
then there will be three mutual strangers, in the second case possibly 3 mutual friends...
if four groups (1-2-1-1) than there are 3 mutual strangers, person A does not know B, C, and D; person E will also not know persons B, C, and D
if all are strangers then obviously by the above way they will be several sets of mutual strangers
for example: A and B: C,D,E
A,C: B,D,E
A,D: B,C,E... so on and so forth
  Posted by calla tah-n on 2003-05-22 20:59:50

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (11)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information