**Discrete Mathematics: An Open Introduction**

by Oscar Levin

**Publisher**: University of Northern Colorado 2017**ISBN/ASIN**: 1534970746**Number of pages**: 345

**Description**:

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.

Download or read it online for free here:

**Download link**

(1.4MB, PDF)

## Similar books

**Lists, Decisions, and Graphs**

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.

(

**2950**views)

**Discrete Structures**

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.

(

**8050**views)

**Notes on Discrete Mathematics**

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.

(

**15676**views)

**Lecture Notes in Discrete Mathematics**

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.

(

**12312**views)