Discrete Mathematics and Its Applications

ISBN-10: 0073229725

ISBN-13: 9780073229720

Edition: 6th 2007 (Revised)

Authors: Kenneth H. Rosen

List price: $293.67
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


Discrete Mathematics and its Applications, Sixth Edition, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide a wide variety of real-world applications…from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields.
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: $293.67
Edition: 6th
Copyright year: 2007
Publisher: McGraw-Hill Higher Education
Publication date: 7/26/2006
Binding: Mixed Media
Pages: 1008
Size: 8.75" wide x 10.25" long x 1.50" tall
Weight: 5.126
Language: English

Kenneth H. Rosen is a Distinguished Member of the Technical Staff at AT&T Laboratories in Middletown, New Jersey. His current assignment involves the assessment of new technology and the creation of new services for AT&T. Dr. Rosen has written several leading textbooks and many articles. Rosen received his Ph.D. from MIT.

The MathZone Companion Website To the Student
The Foundations: Logic and Proofs
Propositional Logic
Propositional Equivalences
Predicates and Quantifiers
Nested Quantifiers
Rules of Inference
Introduction to Proofs
Proof Methods and Strategy End-of-Chapter Material
Basic Structures: Sets, Functions, Sequences and Sums
Set Operations
Sequences and Summations End-of-Chapter Material
The Fundamentals: Algorithms, the Integers, and Matrices
The Growth of Functions
Complexity of Algorithms
The Integers and Division
Primes and Greatest Common Divisors
Integers and Algorithms
Applications of Number Theory
Matrices End-of-Chapter Material
Induction and Recursion
Mathematical Induction
Strong Induction and Well-Ordering
Recursive Definitions and Structural Induction
Recursive Algorithms
Program Correctness End-of-Chapter Material
The Basics of Counting
The Pigeonhole Principle
Permutations and Combinations
Binomial Coefficients
Generalized Permutations and Combinations
Generating Permutations and Combinations End-of-Chapter Material
Discrete Probability
An Introduction to Discrete Probability
Probability Theory
Bayes’ Theorem
Expected Value and Variance End-of-Chapter Material
Advanced Counting Techniques
Recurrence Relations
Solving Linear Recurrence Relations
Divide-and-Conquer Algorithms and Recurrence elations
Generating Functions
Applications of Inclusion-Exclusion End-of-Chapter Material
Relations and Their Properties
n-ary Relations and Their Applications
Representing Relations
Closures of Relations
Equivalence Relations
Partial Orderings End-of-Chapter Material
Graphs and Graph Models
Graph Terminology and Special Types of Graphs
Representing Graphs and Graph Isomorphism
Euler and Hamilton Paths
Shortest-Path Problems
Planar Graphs
Graph Coloring End-of-Chapter Material
Introduction to Trees
Applications of Trees
Tree Traversal
Spanning Trees
Minimum Spanning Trees End-of-Chapter Material
Boolean Algebra
Boolean Functions
Representing Boolean Functions
Logic Gates
Minimization of Circuits End-of-Chapter Material
Modeling Computation
Languages and Grammars
Finite-State Machines with Output
Finite-State Machines with No Output
Language Recognition
Turing Machines End-of-Chapter Material
Axioms for the Real Numbers and the Positive Integers
Exponential and Logarithmic Functions
Pseudocode Suggested Readings
Answers to Odd-Numbered Exercises
Photo Credits
Index of Biographies
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.