**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

**Applied Finite Mathematics**

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.

(

**7824**views)

**Discrete Math for Computer Science Students**

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.

(

**3849**views)

**Elementary Computer Mathematics**

by

**Kenneth R. Koehler**-

**University of Cincinnati Blue Ash College**

This book is an introduction to the mathematics used in the design of computer and network hardware and software. We will survey topics in computer arithmetic and data representation, logic and set theory, graph theory and computer measurement.

(

**6240**views)

**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.

(

**2146**views)