by Stephen B. Maurer and Anthony Ralston
2004 (803 pages)
ISBN:1568811667
Written in a lively, clear style that talks to the reader, this book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes.
Table of Contents
Discrete Algorithmic Mathematics, Third Edition
Instructor’s Preface
Student’s Preface
Chapter Summaries
Pathways Through the Book
Problem Difficulty Rating
Symbols, Notation, Abbreviations and Conventions
Prologue—What Is Discrete Algorithmic Mathematics?
Chapter 0
-
Mathematical Preliminaries
Chapter 1
Algorithms
Chapter 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
Final Problems
References
Appendix
Limits
