为甚麼要学离散数学.pptVIP

Instructor: Prof. Ruay-Shiung Chang Chapter 1: Fundamental Principles of Counting 1.3 Combinations: The Binomial Theorem E.g. 1.23 Among the 310 strings of length 10, how many have even weight? Ans.: the number of 1’s must be even number of 1’s=i (i=0,2,4,6,8, or 10) number of strings= total= Select i positions for the i 1’s Chapter 1: Fundamental Principles of Counting 1.3 Combinations: The Binomial Theorem Be careful not to overcount. E.g. 1.24 Select 5 cards which have at least 1 club. reasoning (a): all minus no-club reasoning (b): select 1 club first, then other 4 cards What went wrong? Chapter 1: Fundamental Principles of Counting 1.3 Combinations: The Binomial Theorem Be careful not to overcount. E.g. 1.24 Select 5 cards which have at least 1 club. for reasoning (b): select C3 then C5,CK,H7,SJ select C5 then C3,CK,H7,SJ select CK then C5,C3,H7,SJ All are the same selections. Chapter 1: Fundamental Principles of Counting 1.3 Combinations: The Binomial Theorem Be careful not to overcount. E.g. 1.24 Select 5 cards which have at least 1 club. for reasoning (b): correct computation number of clubs selected non-clubs Chapter 1: Fundamental Principles of Counting 1.3 Combinations: The Binomial Theorem Try to prove it by combinatorial reasoning. Theorem 1.1 The Binomial Theorem binomial coefficient Select k x’s from (x+y)n Chapter 1: Fundamental Principles of Counting 1.3 Combinations: The Binomial Theorem E.g. 1.25 The coefficient of x5y2 in (x+y)7 is The coefficient of a5b2 in (2a-3b)7 is Chapter 1: Fundamental Principles of Counting 1.3 Combinations: The Binomial Theorem Corollary 1.1. For any integer n0, (a) (b) (x=y=1) (x=1,y=-1) Chapter 1: Fundamental Principles of Counting 1.3 Combinations: The Binomial Theorem Theorem 1.2 The multinomial theorem For positive integer n,t, the coefficient of in the expansion of is where Chapter 1: Fundamental Principles of Counting 1.3 Combinations: The Binomial Theorem E.g.. 1.26 The coefficient of in is Discrete