Transcription of MATH208: DISCRETE MATHEMATICS
{{id}} {{{paragraph}}}
Example: tourism industry
MATH208: DISCRETE MATHEMATICS
U N D M AT H E M AT I C SM AT H 2 0 8 :D I S C R E T EM AT H E M AT I C SD E PA R T M E N T O F M AT H E M AT I C ST H E U N I V E R S I T Y O F N O R T H DA KOTAC opyright 2017 UND Mathematicspublished by department of mathematicsthe university of north 2005,2006,2007,2008,2009,2014,2015,2016, 2017 University of North Dakota MathematicsDepartmentPermission is granted to copy, distribute and/or modify this document under the terms of the GNU FreeDocumentation License, any later version published by the Free Software Foundation; withno Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included inthe section entitled "GNU Free Documentation License".Second corrected edition, Second printing: December2017 Contents1 Logical Connectives and Compound Implication and :If .. , then .. :.. if and only if .. table to propositional and .. , then .. normal and and to symbolic and basic laws of quantified of propositional with : Basic standard and universal and equality of set set string of by by a counterexample to disprove a a ordered digraph: domain= operations with relation using relation of a of with matrices: Boolean of class of a of an equivalence representation of an equivalence and Their of with DISCRETE domain and by0-1matrix or bipartite (injective) (surjective) of DISCRETE and ceiling
9 16 Mathematical Induction 137 16.1 Mathematical induction 138 16.2 The principle of mathematical induction 139 16.3 Proofs by induction 140 16.4 Examples 142 16.5 Second principle of mathematical induction 144 16.6 Exercises 148 17 Algorithms 149 17.1 Properties of an algorithm 149 17.2 Non-algorithms 150 17.3 Linear search algorithm 150 17.4 Binary search …
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: