Discrete Mathematics

ISBN-10: 0130961418
ISBN-13: 9780130961419
Edition: 4th 1999
List price: $105.00
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

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.

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

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

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

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

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.

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

×
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.

×