Discrete Algorithmic Mathematics

Thoroughly revised for a one-semester course that allows many options, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. The third edition includes new or extended discussions of order notation, generating functions, computational biology, chaos, and aspects of statistics. 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 complete solution manual will be available to instructors.