Discrete Algorithmic Mathematics

Discrete Algorithmic Mathematics

By (author) Stephen B. Maurer , By (author) Anthony Ralston

US$117.11

Free delivery worldwide

Available
Dispatched in 11 business days

When will my order arrive?

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.

show more
  • Hardback | 803 pages
  • 200 x 248 x 50mm | 1,719.13g
  • 21 Jan 2005
  • Taylor & Francis Inc
  • A K Peters
  • Natick
  • English
  • Revised
  • 3rd Revised edition
  • Illustrations (some col.)
  • 1568811667
  • 9781568811666
  • 393,869

Other books in this category

Other people who viewed this bought:

Author Information

Stephen B Maurer (Ph.D. Princeton 1972) is a Professor of Mathematics at Swarthmore College and winner of the Allendoerfer Award for expository writing. Anthony Ralston (Ph.D. MIT 1956) is Professor Emeritus of Computer Science and Mathematics at SUNY Buffalo. He is a former President of the ACM.

show more

Review quote

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

show more