Discrete Mathematics

ISBN-10: 0131593188

ISBN-13: 9780131593183

Edition: 7th 2009

List price: $192.20
eBook available
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


Focused on helping readers understand and construct proofs and, generally, expanding their mathematical maturity this best-seller is an accessible introduction to discrete mathematics. Takes an algorithmic approach that emphasizes problem-solving techniques. Expands discussion on how to construct proofs and treatment of problem solving. Increases number of examples and exercises throughout. Updates textrsquo;s Web site athttp://condor.depaul.edu/tilde;rjohnson/dm7th.
eBooks Starting from $114.99
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Algebra Online content $4.95 $1.99
Add to cart
Study Briefs
Introduction to Logic Online content $4.95 $1.99
Add to cart
Study Briefs
Business Math Formulas Online content $4.95 $1.99
Customers also bought

Book details

List price: $192.20
Edition: 7th
Copyright year: 2009
Publisher: Prentice Hall PTR
Publication date: 12/29/2007
Binding: Hardcover
Pages: 792
Size: 8.00" wide x 10.00" long x 1.50" tall
Weight: 3.454
Language: English

Sets and Logic
Conditional Propositions and Logical Equivalence
Arguments and Rules of Inference
Nested QuantifiersProblem-Solving Corner: Quantifiers
Mathematical Systems, Direct Proofs, and Counterexamples
More Methods of ProofProblem-Solving Corner: Proving Some Properties of Real Numbers
Resolution Proofs
Mathematical InductionProblem-Solving Corner: Mathematical Induction
Strong Form of Induction and the Well-Ordering Property Notes Chapter Review Chapter Self-Test Computer Exercises
Functions, Sequences, and Relations
FunctionsProblem-Solving Corner: Functions
Sequences and Strings
Equivalence RelationsProblem-Solving Corner: Equivalence Relations
Matrices of Relations
Relational Databases
Examples of Algorithms
Analysis of AlgorithmsProblem-Solving Corner: Design and Analysis of an Algorithm
Recursive Algorithms
Introduction to Number Theory
Representations of Integers and Integer Algorithms
The Euclidean AlgorithmProblem-Solving Corner: Making Postage
The RSA Public-Key Cryptosystem
Counting Methods and the Pigeonhole Principle
Basic PrinciplesProblem-Solving Corner: Counting
Permutations and CombinationsProblem-Solving Corner: Combinations
Generalized Permutations and Combinations
Algorithms for Generating Permutations and Combinations
Introduction to Discrete Probability
Discrete Probability Theory
Binomial Coefficients and Combinatorial Identities
The Pigeonhole Principle
Recurrence Relations
Solving Recurrence RelationsProblem-Solving Corner: Recurrence Relations
Applications to the Analysis of Algorithms
Graph Theory
Paths and CyclesProblem-Solving Corner: Graphs
Hamiltonian Cycles and the Traveling Salesperson Problem
A Shortest-Path Algorithm
Representations of Graphs
Isomorphisms of Graphs
Planar Graphs
Instant Insanity
Terminology and Characterizations of TreesProblem-Solving Corner: Trees
Spanning Trees
Minimal Spanning Trees
Binary Trees
Tree Traversals
Decision Trees and the Minimum Time for Sorting
Isomorphisms of Trees
Game Trees
Network Models
A Maximal Flow Algorithm
The Max Flow, Min Cut Theorem
MatchingProblem-Solving Corner: Matching
Boolean Algebras and Combinatorial Circuits
Combinatorial Circuits
Properties of Combinatorial Circuits
Boolean AlgebrasProblem-Solving Corner: Boolean Algebras
Boolean Functions and Synthesis of Circuits
Automata, Grammars, and Languages
Sequential Circuits and Finite-State Machines
Finite-State Automata
Languages and Grammars
Nondeterministic Finite-State Automata
Relationships Between Languages and Automata
Computational Geometry
The Closest-Pair Problem
An Algorithm to Compute the Convex Hull
Algebra Review
Hints and Solutions to Selected Exercises
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.