Transcription of Discrete Mathematics for Computer Science - UH
{{id}} {{{paragraph}}}
Example: dental hygienist
Discrete Mathematics for Computer Science - UH
I. = . 1. ! |~ilHTerms Meaning SectionSets, Proof Templates, and Inductionx e A x is an element ofA f A x is not an element ofA x E A and P(x)} Set notation Natural numbers Integers Rationals Real numbers = B Sets A and B are equal C B A is a subset of B g B A is nota subset of B C B A is a proper subset of B 5 B A is nota proper subset of B a bimplies a b a if and only if b A union B A intersect B Generalized union of family of sets X Generalized intersection of family of sets X Xi Xm U ..UXn Xm n .. n Xn -B Elements of A not in B Elements not in A D B (A U B) -(A n B) (X) Power set of X x Y Product of X and Y A y Meet ofx and y v y Join ofx and y Complement of x Top Bottom Cardinality of A a,, + " -". + a,, Meaning SectionFormal Logic"--p Not p p and q p or q q p implies q q p is equivalent to q X S logically implies X 3 AKP Conjecture about complexity (Vx)P(x) For all x, P(x) (3x)P(x) There exists an x such that P(x) (VxE V)P(x) For all X EV, P(x) (3x E V)P(x) There exists an x E V such that P(x) [i.]
4.3.2 Inverses of Functions 245 4.3.3 Other Operations on Functions 248 4.4 Sequences and Subsequences 248 4.5 Exercises 251 4.6 The Pigeon-Hole Principle 253 4.6.1 k to 1 Functions 254 4.6.2 Proofs of the Pigeon-Hole Principle 255 4.6.3 Application: Decimal Expansion of Rational Numbers 257
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: