Skip to content

Discrete Mathematics

Best in textbook rentals since 2012!

ISBN-10: 0130961418

ISBN-13: 9780130961419

Edition: 4th 1999

Authors: Kenneth A. Ross, Charles R. B. Wright

List price: $105.00
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

The new edition of this introductory discrete mathematics text responds to change in typical student preparation and to developments in computer science, with numerous revisions prompted by classroom experience.
Customers also bought

Book details

List price: $105.00
Edition: 4th
Copyright year: 1999
Publisher: Prentice Hall PTR
Publication date: 1/28/1999
Binding: Hardcover
Pages: 690
Size: 7.20" wide x 9.57" long x 1.18" tall
Weight: 2.552
Language: English

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