组合数学chapter1.pptVIP

* Chapter 1 What is Combinatorics? What is combinatorics? Almost everyone has delt with the problems of combinatorics. The following are some examples: The number of games that n terms would play. Construct magic squares. The ideas and techniques of combinatorics are widely used in: Physical science. Biological science. Information theory. So many mathematical disciplines. Two general types of problems of Combinatorics: Existence of the arrangement; Enumeration or classification of the arrangement. Two other problems in conjunction with the above: Study of the known arrangement; Construction of an optimal arrangement. The typical form of the combinatorial problem: Is it possible to arrange ……? Does there exist a ……? In how many ways can ……? Count the number of ……? Example 1: Perfect cover of chessboard A chessboard has 64 squares in 8 rows and 8 columns. A domino has 2 adjacent squares. Is it possible to arrange 32 dominoes to cover every square of chessboard (of course no 2 dominoes overlap)? Such an arrangement is called a perfect cover. The number of perfect covers is 12,988,816= , which was found by Fischer in 1961. Some generalizations: 8-by-8 to m-by-n. The perfect cover need not exist now, such as m=n=3. It is easy to know that there is a perfect cover if and only if at least one of m and n is even II. Pruned chessboard: Cut out two diagonally opposite squares. There is no perfect cover. We can prove it by assigning them two colors: 31BW 32B+30W Perfect cover exists implies B=W. But the inverse is false. for example: III. b-omino b-omino is b squares joined side by side consecutively. If b|m or b|n, then m-by-n board has perfect cover, and vice versa. The proof is as follows: It is obvious if b is prime. If b is not prime and b1. Then write Suppose r s. Then we show r=0. Using 10-by-11 as an example. 1 2 3 4 1 2 3