Mathematics: A Discrete Introduction

This book has two primary objectives: It teaches students fundamental concepts in discrete mathematics (from counting to basic cryptography to graph theory), and it teaches students proof-writing skills. With a wealth of learning aids and a clear presentation, the book teaches students not only how to write proofs, but how to think clearly and present cases logically beyond this course. Overall, this book is an introduction to mathematics. In particular, it is an introduction to discrete mathematics. All of the material is directly applicable to computer science and engineering, but it is presented from a mathematician's perspective. While algorithms and analysis appear throughout, the emphasis is on mathematics. Students will learn that discrete mathematics is very useful, especially those whose interests lie in computer science and engineering, as well as those who plan to study probability, statistics, operations research, and other areas of applied mathematics.

Edward R. Scheinerman is Professor in the Department of Applied Mathematics and Statistics at The Johns Hopkins University. Dr. Scheinerman's research interests include discrete mathematics; especially graph theory, partially ordered sets, random graphs, and combinatorics, as well as applications to robotics and networks.