Selecting a mathematics textbook that meets the needs of a diverse student body can be a challenge. Some have too much information for a beginner; some have too little. The authors of Fundamentals of Discrete Structures, frustrated by their search for the perfect text, decided to write their own. The result provides an excellent introduction to discrete mathematics that is both accessible to liberal arts majors satisfying their core mathematics requirements, and also challenging enough to engage math and computer science majors. To engage students who may not be comfortable with traditional mathematics texts, the book uses a light tone when introducing new concepts. While there is an emphasis on computation, it avoids mathematical formalism and formal proofs, thus making it easier for the average student to understand. Unlike other textbooks in this field, Fundamentals of Discrete Structuresstrikes just the right balance: it illuminates the essentials of discrete mathematics while still providing a comprehensive treatment of the subject matter.

• Damian Lyons earned his Ph.D. in Computer Science from the University of Massachusetts at Amherst in 1986. The recipient of numerous Philips Research awards, he is also the inventor/co-inventor on 14 U.S. patents and 7 European patents for work in robotics and computer vision. He is a professor at Fordham University.

• Christina Papadakis-Kanaris was awarded her M.S. in Computer Science from Fordham University in 2006. She now teaches at Fordham University.

• Gary Weiss received his Ph.D. in Computer Science from Rutgers University in 2003. He serves on the editorial board of the International Journal of Data Mining, Modelling, and Management, and he has received awards for his work in artificial intelligence and data mining. He is a professor at Fordham University.

• Arthur Werschulz earned his Ph.D. in mathematics from Carnegie-Mellon University in 1977. He is the author and co-author of several books on mathematics. He also serves on the editorial board of the Journal of Complexity. He is a professor at Fordham University.

1.       Introduction

2.       Sets and Sequences

3.       Logic

4.       Relations

5.       Functions

6.       Counting

7.       Probability

8.       Algorithms

9.       Graphs