An Introduction to Discrete Mathematics

by Steven Roman

Intended for a one-term course in discrete mathematics, to prepare freshmen and sophomores for further work in computer science as well as mathematics. Sets, proof techniques, logic, combinatorics, and graph theory are covered in concise form. All topics are motivated by concrete examples, often emphasizing the interplay between computer science and mathematics. Examples also illustrate all definitions. Applications and references cover a wide variety of realistic situations. Coverage of mathematical induction includes the stroung form of induction, and new sections have been added on nonhomogeneous recurrence relations and the essentials of probability.

455 pages, Hardcover

First published January 1, 1986

Reviews

[Dhiren · Rating 5 out of 5]

This is an outstanding introduction to discrete mathematics. One if the few college texts that I keep coming back to over and over again to refresh or review material.

[Sean · Rating 5 out of 5]

Taught myself discrete math with this text. Book is pretty short and I did every odd problem in the book and noticed only 2 mistakes in problems and it was easy to figure out what the did wrong.