Discrete Algorithmic Mathematics

ISBN-13: 9781568811666 / Angielski / Twarda / 2005 / 803 str.

Stephen B. Maurer; Anthony Ralston

Opis

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.

Recenzje

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

Spis treści

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

O autorze

Stephen B Maurer Swarthmore College Anthony Ralston State University of New York at Buffalo