Skip to content

Discrete Mathematics

Best in textbook rentals since 2012!

ISBN-10: 0130652474

ISBN-13: 9780130652478

Edition: 5th 2003 (Revised)

Authors: Kenneth Ross, Charles Wright

List price: $146.65
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!

Rental notice: supplementary materials (access codes, CDs, etc.) are not guaranteed with rental orders.

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!

Description:

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: $146.65
Edition: 5th
Copyright year: 2003
Publisher: Pearson Education
Publication date: 8/21/2002
Binding: Paperback
Pages: 632
Size: 8.35" wide x 10.90" long x 1.75" tall
Weight: 3.542
Language: English

Kenneth R. Ross, parish minister at Netherlorn in Argyll and Hon Fellow of the University of Edinburgh, is Chair of the Scotland Malawi Partnership. From 1988 to 1998 he lived, with his family, in Zomba where he served as Professor of Theology at the University of Malawi and as a minister of the Church of Central Africa Presbyterian (CCAP).

Charles Wright received the National Book Award for Poetry in 1983 for "Country Music", the Lenore Marshall Poetry Prize in 1995 for "Chickamauga", & the Pulitzer Prize & National Book Critics Circle Award in 1998 for "Black Zodiac".

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