Always Learning

Discrete and Combinatorial Mathematics, 5/E
Ralph P. Grimaldi, Rose-Hulman Institute of Technology

ISBN-10: 0201726343
ISBN-13:  9780201726343

Publisher:  Pearson
Copyright:  2004
Format:  Cloth
Published:  07/17/2003
Status: Instock


Customers outside the U.S., click here.


Print this content

In this section:


Description

This fifth edition continues to improve on the features that have made it the market leader. The text offers a flexible organization, enabling instructors to adapt the book to their particular courses. The book is both complete and careful, and it continues to maintain its emphasis on algorithms and applications. Excellent exercise sets allow students to perfect skills as they practice. This new edition continues to feature numerous computer science applications-making this the ideal text for preparing students for advanced study.


Features

  • This text has an enhanced mathematical approach, with carefully thought out examples, including many examples with computer sciences applications.
  • Historical reviews and biographies bring a human element to their assignments.
  • Chapter summaries allow students to review what they have learned.
  • Expanded treatment of discrete probability in Chapter 3.
  • New material on cryptology, private-key cryptosystems in Chapter 14; public-key RSA cryptosystems in Chapter 16.


New To This Edition

  • New web site: http://www.aw.com/grimaldi


Table of Contents

PART 1. FUNDAMENTALS OF DISCRETE MATHEMATICS.

1. Fundamental Principles of Counting.

The Rules of Sum and Product.

Permutations.

Combinations: The Binomial Theorem.

Combinations with Repetition.

The Catalan Numbers (Optional).

Summary and Historical Review.

2. Fundamentals of Logic.

Basic Connectives and Truth Tables.

Logical Equivalence: The Laws of Logic.

Logical Implication: Rules of Inference.

The Use of Quantifiers.

Quantifiers, Definitions, and the Proofs of Theorems.

Summary and Historical Review.

3. Set Theory.

Sets and Subsets.

Set Operations and the Laws of Set Theory.

Counting and Venn Diagrams.

A First Word on Probability.

The Axioms of Probability (Optional).

Conditional Probability: Independence (Optional).

Discrete Random Variables (Optional).

Summary and Historical Review.

4. Properties of the Integers: Mathematical Induction.

The Well-Ordering Principle: Mathematical Induction.

Recursive Definitions.

The Division Algorithm: Prime Numbers.

The Greatest Common Divisor: The Euclidean Algorithm.

The Fundamental Theorem of Arithmetic.

Summary and Historical Review.

5. Relations and Functions.

Cartesian Products and Relations.

Functions: Plain and One-to-One.

Onto Functions: Stirling Numbers of the Second Kind.

Special Functions.

The Pigeonhole Principle.

Function Composition and Inverse Functions.

Computational Complexity.

Analysis of Algorithms.

Summary and Historical Review.

6. Languages: Finite State Machines.

Language: The Set Theory of Strings.

Finite State Machines: A First Encounter.

Finite State Machines: A Second Encounter.

Summary and Historical Review.

7. Relations: The Second Time Around.

Relations Revisited: Properties of Relations.

Computer Recognition: Zero-One Matrices and Directed Graphs.

Partial Orders: Hasse Diagrams.

Equivalence Relations and Partitions.

Finite State Machines: The Minimization Process.

Summary and Historical Review.

PART 2. FURTHER TOPICS IN ENUMERATION.

8. The Principle of Inclusion and Exclusion.

The Principle of Inclusion and Exclusion.

Generalizations of the Principle.

Derangements: Nothing Is in Its Right Place.

Rook Polynomials.

Arrangements with Forbidden Positions.

Summary and Historical Review.

9. Generating Functions.

Introductory Examples.

Definition and Examples: Calculational Techniques.

Partitions of Integers.

The Exponential Generating Functions.

The Summation Operator.

Summary and Historical Review.

10. Recurrence Relations.

The First-Order Linear Recurrence Relation.

The Second-Order Linear Homogeneous Recurrence Relation with Constant Coefficients.

The Nonhomogeneous Recurrence Relation.

The Method of Generating Functions.

A Special Kind of Nonlinear Recurrence Relation (Optional).

Divide and Conquer Algorithms.

Summary and Historical Review.

PART 3. GRAPH THEORY AND APPLICATIONS.

11. An Introduction to Graph Theory.

Definitions and Examples.

Subgraphs, Complements, and Graph Isomorphism.

Vertex Degree: Euler Trails and Circuits.

Planar Graphs.

Hamilton Paths and Cycles.

Graph Coloring and Chromatic Polynomials.

Summary and Historical Review.

12. Trees.

Definitions, Properties, and Examples.

Rooted Trees.

Trees and Sorting.

Weighted Trees and Prefix Codes.

Biconnected Components and Articulation Points.

Summary and Historical Review.

13. Optimization and Matching.

Dijkstra's Shortest Path Algorithm.

Minimal Spanning Trees: The Algorithms of Kruskal and Prim.

Transport Networks: The Max-Flow Min-Cut Theorem.

Matching Theory.

Summary and Historical Review.

PART 4. MODERN APPLIED ALGEBRA.

14. Rings and Modular Arithmetic.

The Ring Structure: Definition and Examples.

Ring Properties and Substructures.

The Integers Modulo n. Cryptology.

Ring Homomorphisms and Isomorphisms: The Chinese Remainder Theorem.

Summary and Historical Review.

15. Boolean Algebra and Switching Functions.

Switching Functions: Disjunctive and Conjunctive Normal Forms.

Gating Networks: Minimal Sums of Products: Karnaugh Maps.

Further Applications: Don't-Care Conditions.

The Structure of a Boolean Algebra (Optional).

Summary and Historical Review.

16. Groups, Coding Theory, and Polya's Theory of Enumeration.

Definition, Examples, and Elementary Properties.

Homomorphisms, Isomorphisms, and Cyclic Groups.

Cosets and Lagrange's Theorem.

The RSA Cipher (Optional).

Elements of Coding Theory.

The Hamming Metric.

The Parity-Check and Generator Matrices.

Group Codes: Decoding with Coset Leaders.

Hamming Matrices.

Counting and Equivalence: Burnside's Theorem.

The Cycle Index.

The Pattern Inventory: Polya's Method of Enumeration.

Summary and Historical Review.

17. Finite Fields and Combinatorial Designs.

Polynomial Rings.

Irreducible Polynomials: Finite Fields.

Latin Squares.

Finite Geometries and Affine Planes.

Block Designs and Projective Planes.

Summary and Historical Review.

Appendices.

Exponential and Logarithmic Functions.

Matrices, Matrix Operations, and Determinants.

Countable and Uncountable Sets.

Solutions.

Index.



Back to top

Print this content

In this section:

Instructor's Solutions Manual for Discrete and Combinatorial Mathematics, 5/E
Grimaldi
©2004  |  Pearson  |  Paper; 480 pp  |  Instock
ISBN-10: 0201726602  |  ISBN-13: 9780201726602

Show Downloadable Files
 | More Info

Back to top


Student resources

Student Solutions Manual for Discrete and Combinatorial Mathematics, 5/E
Grimaldi
©2004  |  Pearson  |  Paper  |  Instock
ISBN-10: 0321200330  |  ISBN-13: 9780321200334
More Info


For Discrete Math

Discrete Math Workbook: Interactive Exercises
Bush
©2003  |  Pearson  |  Paper; 404 pp  |  Instock
ISBN-10: 0130463272  |  ISBN-13: 9780130463272
More Info

Practice Problems in Discrete Mathematics
Obrenic
©2003  |  Pearson  |  Paper; 275 pp  |  Instock
ISBN-10: 0130458031  |  ISBN-13: 9780130458032
More Info


Back to top

For the Mathematics Discipline

Allied Health Study Card, 2/E
Forshier
©2006  |  Pearson  |  Study Card  |  Instock
ISBN-10: 0321394747  |  ISBN-13: 9780321394743
More Info

Basic Math Review Card, 2/E
Addison-Wesley
©2006  |  Pearson  |  Study Card; 6 pp  |  Instock
ISBN-10: 0321394763  |  ISBN-13: 9780321394767
More Info

Center for Excellence Sticker
Addison Wesley Higher Education Group
©2000  |  Pearson  |  Unknown / Other  |  Instock
ISBN-10: 0201716275  |  ISBN-13: 9780201716276
More Info

Concept Videos: Algebra
Addison-Wesley
©2008  |  Pearson  |  Multiple Media Package  |  Instock
ISBN-10: 0321517199  |  ISBN-13: 9780321517197
More Info

Concept Videos: Basic Math & Prealgebra
Addison-Wesley
©2008  |  Pearson  |  Multiple Media Package  |  Instock
ISBN-10: 032151758X  |  ISBN-13: 9780321517586
More Info

Discovering Algebra: Examples with Keystrokes on the TI-83/TI-82 and TI-85/TI-86, A Laboratory Approach
Pirich & Bigliani
©1997  |  Pearson  |  Paper; 195 pp  |  Instock
ISBN-10: 0136492037  |  ISBN-13: 9780136492030
More Info

Graphing Calculator Tutorial CD
Addison-Wesley
©2006  |  Pearson  |  CD-ROM Only  |  Instock
ISBN-10: 0321357744  |  ISBN-13: 9780321357748
More Info

Overcoming Math Anxiety, 2/E
Davidson & Levitov
©2000  |  Pearson  |  Paper  |  Instock
ISBN-10: 0321069188  |  ISBN-13: 9780321069184
More Info

Prealgebra Review Workbook
Wheel
©2006  |  Pearson  |  Paper; 300 pp  |  Instock
ISBN-10: 0321473329  |  ISBN-13: 9780321473325
More Info

Review of Algebra, A
Howard
©2002  |  Pearson  |  Paper; 224 pp  |  Instock
ISBN-10: 0201773473  |  ISBN-13: 9780201773477
More Info

Spanish Basic Math Study Card
Leonarte
©2007  |  Pearson  |  Study Card  |  Instock
ISBN-10: 0321438582  |  ISBN-13: 9780321438584
More Info

TestGen All-in-One 2005 Package
Addison-Wesley
©2005  |  Pearson  |  CD-ROM Only  |  Instock
ISBN-10: 0321334469  |  ISBN-13: 9780321334466
More Info


Back to top

Print this content

Give your students a choice! PearsonChoices products are designed to give your students more value and flexibility by letting them choose from a variety of text and media formats to best match their learning style and their budget.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, see the Packages Tab.

  • Pearson Custom Mathematics
    Pearson
    ©2009  |  Pearson  |  On-line Supplement  |  Live
    ISBN-10: 0321625242  |  ISBN-13: 9780321625243
    More Info


Back to top

Log in to the Instructor Resource Center

Login name: 

  Password: 

Forgot login/password?  |  Need to redeem an access code?

        

Instructor Resource Center File Download

This work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning. Dissemination or sale of any part of this work (including on the World Wide Web) will destroy the integrity of the work and is not permitted. The work and materials from this site should never be made available to students except by instructors using the accompanying text in their classes. All recipients of this work are expected to abide by these restrictions and to honor the intended pedagogical purposes and the needs of other instructors who rely on these materials.

Cancel     I accept, proceed with download

Print this content

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, browse our available packages below, or contact your Pearson Higher Education representative to create your own package.

Package ISBN-10: 0321342992 | ISBN-13: 9780321342997
©2004 | Instock (Additional assembly time required)
Suggested retail price: $149.33  Buy from myPearsonStore

This package contains:



Back to top