Discrete Algorithmic Mathematics
3rd Edition
Published on 21. January 2005
803 pages
978-1-4665-8612-3 (ISBN)
Description
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, the book is unique in 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.
Reviews / Votes
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.-EMS, March 2006
In a textbook, it is necessary to select carefully the statements and difficulty of the problems ... in this textbook, this is fully achieved ... This review considers this book an excellent one.
-The Mathematical Gazette, March 2006
More details
Edition
3rd edition
Language
English
Place of publication
Florida
United States
Publishing group
Taylor & Francis Inc
Target group
College/higher education
Product notice
Reflowable
ISBN-13
978-1-4665-8612-3 (9781466586123)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Stephen B. Maurer | Anthony Ralston
Discrete Algorithmic Mathematics
Book
01/2005
3rd Edition
A K Peters
€170.84
Shipment within 3-4 weeks
Persons
Stephen B Maurer Swarthmore College Anthony Ralston State University of New York at Buffalo
Content
PROLOGUE What Is Discrete Algorithmic Mathematics? CHAPTER 0 Mathematical Preliminaries CHAPTER 1 AlgorithmsCHAPTER 2 Mathematical Induction CHAPTER 3 Graphs and Trees CHAPTER 4 Fundamental Counting Methods CHAPTER 5 Difference Equations CHAPTER 6 Probability CHAPTER 7 An Introduction to Mathematical Logic EPILOGUE Coming Full Circle with Biology and Minimax Theorems
