Introduction To Finite Mathematics
by J. G. Kemeny, J. L. Snell, G. L. Thompson
Publisher: Prentice-Hall 1974
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.
Home page url
Download or read it online for free here:
(multiple PDF files)
by W W L Chen - Macquarie University
Logic and sets, the natural numbers, division and factorization, languages, finite state machines, finite state automata, Turing machines, groups and modulo arithmetic, introduction to coding theory, group codes, public key cryptography, etc.
by Marcel B. Finan - Arkansas Tech University
This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in computer science, engineering, Business, and the sciences.
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.
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.