Well-known and highly regarded, Discrete Algorithmic Mathematics is an outstanding text for a half- or full-year course in discrete mathematics. Written in a clear and lively style, the book's emphasis is on themes and ideas, making it more coherent and extensive than other discrete mathematics textbooks.

Discrete Algorithmic Mathematics

Science & Math

Ralston, Anthony

Maurer, Stephen B.

Mathematics

Addison-Wesley

This book will be of interest to anyone of any age who likes good problems. Pre-calculus background is presumed. 
Over the years perhaps the most popular of the MAA problem books have been the high school contest books, covering the yearly American High School Mathematics Examinations (AHSME) that began in 1950, co-sponsored from the start by the MAA. Book V also includes the first six years of the American Invitational Mathematics Examination (AIME) which was developed as an intermediate step between the AHSME and the USA Mathematical Olympiad (USAMO). The AIME has a unique answer format--all answers are integers between 0 and 999. The editors of this volume, George Berzsenyi and Stephen B. Maurer, were respectively the chairs of the AIME and the AHSME. In addition to a thorough index, they have added material to Contest Problem Book V not included in Contest Books I–IV, such as: a comprehensive worldwide guide to other problem materials, additional solutions to selected problems, and information on the development and history of the AHSME, AIME, and USAMO tests.

The Contest Problem Book V: American High School Mathematics Examinations (AHSME) / American Invitational Mathematics Examinations (AIME) 1983-1988 (ANNELI LAX NEW MATHEMATICAL LIBRARY)

Berzsenyi, George

Mathematical Assn of Amer

Discrete Algorithmic Mathematics, Second Edition

Computers & Technology

A K Peters/CRC Press

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.

Operating Systems

See the best price to sell, buy, or rent books by Maurer, Stephen B.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Maurer, Stephen B.