Introduction To Finite Mathematics
by J. G. Kemeny, J. L. Snell, G. L. Thompson
Publisher: Prentice-Hall 1974
ISBN/ASIN: B000O030DK
Description:
The purpose of this book is to introduce college students to the elementary theory of logic, sets, probability theory, and linear algebra and to treat a number of practical applications either from everyday situations or from applications to the biological and social sciences.
Download or read it online for free here:
Download link
(multiple PDF files)
Similar books

by Vladlen Koltun - Stanford University
Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; Inclusion-Exclusion Principle; Pigeonhole Principle; etc.
(11545 views)

by Edward A. Bender, S. Gill Williamson - University of California, San Diego
In this book, four basic areas of discrete mathematics are presented: Counting and Listing, Functions, Decision Trees and Recursion, and Basic Concepts in Graph Theory. At the end of each unit is a list of Multiple Choice Questions for Review.
(6931 views)

by Jean Gallier - arXiv
These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.
(15019 views)

by Herbert S. Wilf - A K Peters, Ltd.
The book about main ideas on generating functions and some of their uses in discrete mathematics. Generating functions are a bridge between discrete mathematics and continuous analysis. The book is suitable for undergraduates.
(21029 views)