Discrete Mathematics: An Open Introduction
by Oscar Levin
Publisher: University of Northern Colorado 2017
Number of pages: 345
This book was written to be used as the primary text for a transitions course (introduction to proof), as well as an introduction to topics in discrete mathematics. Topics: Counting; Sequences; Symbolic Logic and Proofs; Graph Theory; Generating Functions; Introduction to Number Theory.
Home page url
Download or read it online for free here:
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 Edward A. Bender, S. Gill Williamson - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
by Ken Bogart, Cliff Stein - Dartmouth College
It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.
by Miguel A. Lerma
Summary of the course CS 310: Mathematical Foundations of Computer Science. It covers concepts of discreet mathematics and applications to computer science, logic and Boolean circuits, functions, sets, relations, databases, finite automata, and more.