Discrete and Combinatorial Mathematics: An Applied Introduction*Appropriate for four different courses: Discrete Mathematics; Combinatorics; Graph Theory; Modern Applied Algebra. *Flexible, modular organization. *This text has an enhanced mathematical approach, with carefully thought out examples, including many examples with computer sciences applications. *Carefully thought-out examples, including examples with computer science applications. Students can learn by reading the text. *The Fourth Edition has added more elementary problems, creating a larger variety of level within the problem sets which allows students to establish skills as they practice. *Chapter summaries allow the student to review what they have learned, while historical reviews and biographies bring a human element to their assignments. 1. Fundamentals of Discrete Mathematics. Fundamental Principles of Counting. The Rules of Sum and Product. Permutations. Combinations: . The Binomial Theorem. Combinations with Repetition: Distributions. An Application in the Physical Sciences (Optional). 2. Fundamentals of Logic. Basic Connectives and Truth Tables. Logical Equivalence: The Laws of Logic. Logical Implication: Rules of Inference. The Use of Quantifiers. Quantifiers, Definiti |
Contents
Fundamentals of Logic | 47 |
Set Theory | 127 |
Mathematical Induction | 163 |
Copyright | |
15 other sections not shown
Other editions - View all
Discrete and Combinatorial Mathematics: An Applied Introduction Ralph P. Grimaldi No preview available - 1999 |
Discrete and Combinatorial Mathematics: An applied Introduction ( For VTU) Grimaldi Ralph P. No preview available - 2013 |
Common terms and phrases
a₁ a₂ addition algorithm b₁ b₂ binary operation Boolean algebra c₁ c₂ called Chapter coefficient colors column Consequently consider contains countable defined Definition denote Determine divisors edges elements equation equivalence relation EXAMPLE Exercise Figure finite state machine four function f G₂ gcd(a given graph G Hamilton cycle Hasse diagram Hence input integer integral domain inverse isomorphic labeled Latin squares Let f Let G loop-free Mathematical Induction matrix multiplication one-to-one P₁ partition path permutations polynomial poset positive integer primitive statements problem proof prove r₁ R₂ real numbers recurrence relation result ring S₁ s₂ Section sequence shown in Fig spanning tree step string subgraph subset summand Table Theorem theory true truth value undirected graph V₁ V₂ variables vertex vertices Vx p(x write wxyz x₁