Publisher: Wikibooks 2012
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. This book will help you think well about discrete problems: problems like chess, in which the moves you make are exact, problems where tools like calculus fail because there's no continuity, problems that appear all the time in games, puzzles, and computer science.
Home page url
Download or read it online for free here:
by C. D. H. Cooper - Macquarie University
This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.
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 M. Desbrun, P. Schroeder, M. Wardetzky - Columbia University
This new and elegant area of mathematics has exciting applications, as this text demonstrates by presenting practical examples in geometry processing (surface fairing, parameterization, and remeshing) and simulation (of cloth, shells, rods, fluids).
by Rupinder Sekhon - Connexions
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.