朋友問題 (六人)

2012-11-17 10:25 pm
證明世界上任意六人, 當中必有三人是互相認識 (即 A 認識 B 和 C, B 亦認識 C) 或互相不認識 (即 A 不認識 B 和 C, B 亦不認識 C)
更新1:

涉及鴿籠原理

回答 (2)

2012-11-18 2:22 am
✔ 最佳答案
Proof by contradiction. Assume the 2 group types below do not exist.Group type I: a group of 3 and all of them are friendsGroup type II: a group of 3 and all of them are strangersStarting with A, A can have 0, 1, 2, 3, 4 or 5 friends in the group which corresponds to 5, 4, 3, 2, 1 or 0 strangers. So A has at least 3 friends or sees at least 3 strangersCase (a) A has at least 3 friends, say, B, C, D then no pair of them can be friends otherwise together with A, they form a group type I. But if they do not know each other, then they form a group type II.Case (b) A sees at least 3 strangers, say, B, C, D then they must know each other otherwise any pair of strangers together with A will form a group type II. But if they know each other, they form a group type I.Since there are contradictions in both cases (a) & (b), the assumption cannot be true.
2012-11-18 12:59 am
小世界啊…
初生嬰兒算不算xD


收錄日期: 2021-04-24 10:08:45
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20121117000051KK00173

檢視 Wayback Machine 備份