组合数学英文原文.docVIP

组合数学英文原文 1 Pigeonhole Principle: Simple form Theorem 1.1. If n +1 objects are put into n boxes, then at least one box contains two or more objects. Proof. Trivial. Example 1.1. Among 13 people there are two who have their birthdays in the same month. nn.2. There are married couples. How many of the 2 people must be selected in Example 1 order to guarantee that one has selected a married couple? Other principles related to the pigeonhole principle: nn objects are put into boxes and no box is empty, then each box contains exactly one , If object. nn, If objects are put into boxes and no box gets more than one object, then each box has an object. The abstract formulation of the three principles: Let and be finite sets and let YX fXY:,be a function. , If has more elements than , then f is not one-to-one. YX , If and have the same number of elements and f is onto, then f is one-to-one. YX , If and have the same number of elements and f is one-to-one, then f is onto. YX Example 1.3. In any group of n people there are at least two persons having the same number xxfriends. (It is assumed that if a person is a friend of then is also a friend of .) yy xProof. The number of friends of a person is an integer with . If there is a 01,,,knk person whose number of friends is , then everyone is a friend of , that is, no one has yyn,1 aaa,,,0 friend. This means that 0 and can not be simultaneously the numbers of kkk1211，，n friends of some people in the group. The pigeonhole principle tells us that there are at least two people having the same number of friends. aaa,,,n integers , not necessarily distinct, there exist integers Example 1.4. Given k12n nand with such that the sum is a multiple of . 0,kll,n nProof. Consider the integers aaaaaaaaa,,,,，，，，， nDividing these integers by , we have aaaqnr，，，,，,01,,,rnin,1,2, , 12iiii rrr,,,r,0aaa，，，If one of the remainders is zero, say, , then is a multiple 12nk12k rrr,,,11,,,rnnof . If none of is zero, then two of th