Discrete Mathematics: An Open Introduction

Large book cover: Discrete Mathematics: An Open Introduction

Discrete Mathematics: An Open Introduction

Publisher: University of Northern Colorado
ISBN/ASIN: 1534970746
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:
Download link
(1.4MB, PDF)

Similar books

Book cover: Mathematics for Algorithm and Systems AnalysisMathematics for Algorithm and Systems Analysis
by - 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.
Book cover: Discrete StructuresDiscrete Structures
by - 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.
Book cover: Languages and MachinesLanguages and Machines
by - 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.
Book cover: Notes on Discrete MathematicsNotes on Discrete Mathematics
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.