Discrete mathematics / Kenneth A. Ross, Charles R.B. Wright.

Enhanced descriptions from Syndetics:

The distinguishing characteristic of Ross and Wright is a sound mathematical treatment that increases smoothly in sophistication. The book presents utility-grade discrete math tools so students can understand them, use them, and move on to more advanced mathematical topics. *NEW-An introductory section giving gentle, motivated warm-up questions that point out the importance of precision, examples, and abstraction as problem-solving tools. *NEW-Dependence on previous mathematical background and sophistication is reduced to give students with rusty skills a better chance at understanding the new ideas in discrete mathematics. *NEW-The chapter on elementary logic is extensively revised to place even more emphasis on logical thinking. *NEW-A revised presentation makes algorithms easier to translate into object-oriented programs. *NEW-Some long sections have been broken up. In particular, the account of Boolean algebras is substantially reworked to keep the abstract outline clear and to lead naturally to applications. *NEW-The section on big-oh notation is now in the chapter on induction where it is also closer to the algorithmic applications. *NEW-Chapters devoted to probability and al

Table of contents provided by Syndetics

• 1 Sets, Sequences and Functions
• Some Warmup Questions
• The Natural Numbers
• Some Special Sets
• Set Operations
• Sequences
• Functions
• Inverses of Functions
• 2 Elementary Logic
• Informal Introduction
• Propositional Calculus
• Methods of Proof
• Logic in Proofs
• Analysis of Arguments
• 3 Relations
• Relations
• Digraphs and Graphs
• Matrices
• Multiplication of Matrices
• Equivalence Relations and Partitions
• The Division Algorithm and Z(p)
• 4 Induction and Recursion
• Loop Invariants
• Mathematical Induction
• Big-Oh Notation
• Recursive Definitions
• Recurrence Relations
• More Induction
• The Euclidean Algorithm
• 5 Counting
• Basic Counting Techniques
• Elementary Probability
• Inclusion-Exclusion Principle and Binomial Methods
• Counting and Partitions
• Pigeon-Hole Principle
• Independence in Probability
• 6 Introduction to Graphs and Trees
• Graphs
• Edge Traversal Problems
• Trees
• Rooted Trees
• Vertex Traversal Problems
• Minimum Spanning Trees
• 7 Recursion, Trees and Algorithms
• General Recursion
• Recursive Algorithms
• Depth-First Search Algorithms
• Labeling Algorithms
• Polish Notation
• Weighted Trees
• 8 Digraphs
• Digraphs
• Weighted Digraphs
• Digraph Algorithms
• Modifications and Applications of the Algorithms
• 9 Boolean Algebra
• Boolean Algebras
• Isomorphisms of Boolean Algebras
• Boolean Expressions
• Logic Networks
• Karnaugh Maps
• 10 More Relations
• Partially Ordered Sets
• Special Orderings
• Properties of General Relations
• Closures of Relations
• 11 Predicate Calculus and Infinite Sets
• Quantifiers
• Elementary Predicate Calculus
• Infinite Sets