Discrete Algorithmic Mathematics
Third Edition

by Stephen Maurer, Anthony Ralston
Price: $95.00
Availability: In stock.

Summary

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology.

Written in a lively, clear style that talks to the reader, the book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications, not just to mathematics and computer science, but to natural and social science as well.

A manual of selected solutions is available for sale to students; see sidebar. A complete solution manual is available free to instructors who have adopted the book as a required text. To request a copy of the complete solutions contact Susannah Sieper at 303-817-1996 or email marketing@akpeters.com.

The authors have created an Errata sheet, which they update periodically.

Selected excerpts are available for evaluation:

• Contents
• Instructor’s Preface
• Chapter Summaries
• Recursive Algorithms
• Induction and Recursive Algorithms
• Shortest Paths
• Combinatorial Identities and Combinatorial Arguments

Details

ISBN: 978-1-56881-166-6
Year: 2004
Format: Hardcover
Pages: 803

Reviews

The Mathematical Gazette (PDF)

March 2006

“In a textbook it is necessary to select carefully the statements and difficulty of the problems … In my opinion, in this textbook this is fully achieved … This review considers this book an excellent one.”

EMS Newsletter (PDF)

March 2006

“The exposition is self-contained, complemented by diverse exercises and also accompanied by an introduction to mathematical reasoning … this book is an excellent textbook for a one-semester undergraduate course and it includes a lot of additional material to choose from.”