|
回复:一个研究生班里有17人,
Let’s prove by contradiction. www.ddhw.com Suppose the argument is not true, then for any two students, either they are friends or they have a common friend. Consider any person, say A. He/she has exactly 4 friends. Let’s call them B1, B2, B3, and B4. www.ddhw.com Now, the remaining 17 – (4 + 1) = 12 students can’t be A’s friend directly, so they have to know A through Bi’s. www.ddhw.com Since each Bi can have three friends besides A, we are sure that www.ddhw.com - Bi and Bj are not friends, for i ≠ j, and i, j in {1, 2, 3, 4}.
- Bi and Bj have only one common friend A, for i ≠ j, and i, j in {1, 2, 3, 4}.
Both have to be true in order to get the 12 extra students in. www.ddhw.com Let Bi’s friends be A, Ci1, Ci2, Ci3, and let Si be the set of {Ci1, Ci2, Ci3}, for i in {1, 2, 3, 4}. Consider Ci1 and B2’s common friend, he/she has to be someone from S2. Therefore, any member in S1 will have exactly one friend from each of S2, S3, and S4. www.ddhw.com www.ddhw.com Let’s assume C11 and C21 are friend, we claim C12 and C21 can’t be friend. For otherwise, either C22 or C33 can’t have a common friend with B1 (only one of them can be friend of C13). Therefore, members in 4 sets of Si’s can be partitioned into 3 equivalent classes of mutual friends. Just as above, if C11 and C21 are friend, C12 and C21 can’t be friend. By the argument of equivalent classes above, they have no common friend.
www.ddhw.com
|
|
|