Our Privacy Policy has changed. By using this site, you agree to the Privacy Policy.
Buyback Cart Buyback Cart Total Buyback Cart Total
free shipping on buybacks!
Shopping Cart $0.00
free shipping on orders over $35*

    Discrete Mathematics

    ISBN-10: 0131593188
    ISBN-13: 9780131593183
    Edition: 7th 2009
    Description: 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  More...
    List price: $190.20
    Buy it from: $23.56
    This item qualifies for FREE SHIPPING
    30 day, 100% Satisfaction Guarantee

    Used Starting from $130.32

    New Starting from $168.05

    what's this?
    Rush Rewards U
    Members Receive:
    You have reached 400 XP and carrot coins. That is the daily max!
    Study Briefs
    The first one is FREE! All the information you need in one place—a subject summary in digital form. For a limited time, add a Study Brief to your cart with a book purchase or rental and the discount will be applied at checkout.
    Study Briefs
    Calculus 1
    Digital only List price: $4.95
    Sale price: $1.99
    Study Briefs
    Digital only List price: $4.95
    Sale price: $1.99
    Study Briefs
    Introduction to Logic
    Digital only List price: $4.95
    Sale price: $1.99
    Study Briefs
    Business Math Formulas
    Digital only List price: $4.95
    Sale price: $1.99
    Study Briefs
    Italian Grammar
    Digital only List price: $4.95
    Sale price: $1.99
    Customers Also Bought

    List Price: $190.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.388
    Language: English

    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.

    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.