Our Privacy Policy has changed. By using this site, you agree to the Privacy Policy.

Discrete Mathematics and Its Applications

ISBN-10: 0072930330
ISBN-13: 9780072930337
Edition: 5th 2003 (Revised)
Authors: Kenneth H. Rosen
List price: $136.88
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: Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include  More...

what's this?
Rush Rewards U
Members Receive:
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
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Inorganic Chemistry Online content $4.95 $1.99

Customers also bought


Book details

List price: $136.88
Edition: 5th
Copyright year: 2003
Publisher: Glencoe/McGraw-Hill
Publication date: 4/22/2003
Binding: Hardcover
Pages: 896
Size: 8.00" wide x 9.75" long x 1.25" tall
Weight: 4.092
Language: English

Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced problem-solving skills through modeling. Its intent is to demonstrate the relevance and practicality of discrete mathematics to all students. The Fifth Edition includes a more thorough and linear presentation of logic, proof types and proof writing, and mathematical reasoning. This enhanced coverage will provide students with a solid understanding of the material as it relates to their immediate field of study and other relevant subjects. The inclusion of applications and examples to key topics has been significantly addressed to add clarity to every subject.True to the Fourth Edition, the text-specific web site supplements the subject matter in meaningful ways, offering additional material for students and instructors. Discrete math is an active subject with new discoveries made every year. The continual growth and updates to the web site reflect the active nature of the topics being discussed.The book is appropriate for a one- or two-term introductory discrete mathematics course to be taken by students in a wide variety of majors, including computer science, mathematics, and engineering. College Algebra is the only explicit prerequisite.

Discrete Mathematics and Its Applications, Fifth Edition
The Foundations: Logic and Proof, Sets, and Functions
Propositional Equivalences
Predicates and Quantifiers
Nested Quantifiers
Methods of Proof
Set Operations
The Fundamentals: Algorithms, the Integers, and Matrices
The Growth of Functions
Complexity of Algorithms
The Integers and Division
Applications of Number Theory
Mathematical Reasoning, Induction, and Recursion
Proof Strategy
Sequences and Summations
Mathematical Induction
Recursive Definitions and Structural Induction
Recursive Algorithms
Program Correctness
The Basics of Counting
The Pigeonhole Principle
Permutations and Combinations
Binomial Coefficients
Generalized Permutations and Combinations
Generating Permutations and Combinations
Discrete Probability
An Introduction to Discrete Probability
Probability Theory
Expected Value and Variance
Advanced Counting Techniques
Recurrence Relations
Solving Recurrence Relations
Divide-and-Conquer Algorithms and Recurrence Relations
Generating Functions
Applications of Inclusion-Exclusion
Relations and Their Properties
n-ary Relations and Their Applications
Representing Relations
Closures of Relations
Equivalence Relations
Partial Orderings
Introduction to Graphs
Graph Terminology
Representing Graphs and Graph Isomorphism
Euler and Hamilton Paths
Shortest-Path Problems
Planar Graphs
Graph Coloring
Introduction to Trees
Applications of Trees
Tree Traversal
Spanning Trees
Minimum Spanning Trees
Boolean Algebra
Boolean Functions
Representing Boolean Functions
Logic Gates
Minimization of Circuits
Modeling Computation
Languages and Grammars
Finite-State Machines with Output
Finite-State Machines with No Output
Language Recognition
Turing Machines
Exponential and Logarithmic Functions
Table of Contents provided by Publisher. All Rights Reserved.

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.