ECSE 305 Lecture Notes - Sequence, Stabilisation Force In Bosnia And Herzegovina, New Zealand

• School: McGill University
• Department: Electrical Engineering
• Course: ECSE 305
• Professor: Ioannis P.

Document Summary

Chapter overview: review of set theory, combinatorial methods. This may be achieved by either listing all the elements of the set explicitly, as is. {1, 2, 3, 4, 5, 6} (2. 1) or by stating the common properties satis ed by its elements, as in. {a : a is a positive integer 6} (2. 2) If a and b are not identical, we write a (cid:54)= b: example: let a = {1, 2, , 6} and b = {2, 4, 6}. 1 a while 1 (cid:54) b. c(cid:13) 2003 beno t champagne. B a, b a, c (cid:54) a, etc. Theorem 2. 1: let a, b and c denote arbitrary subsets of a sample space s. Proof: these basic properties follow directly from the preceding de nitions; their proof is left as an exercise to the reader. (cid:3) c(cid:13) 2003 beno t champagne. Commonly used sets of numbers: basic sets of numbers: Positive integers, or natural numbers: n = {1, 2, 3, }