**Discrete Structures**

by Vladlen Koltun

**Publisher**: Stanford University 2008**Number of pages**: 89

**Description**:

Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; The Inclusion-Exclusion Principle; The Pigeonhole Principle; Asymptotic Notation; Graphs; Trees; etc.

Download or read it online for free here:

**Download link**

(420KB, PDF)

## Similar books

**Discrete Mathematics with Algorithms**

by

**M. O. Albertson, J. P. Hutchinson**-

**J. Wiley**

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs...

(

**9043**views)

**Topics in Discrete Mathematics**

by

**A.F. Pixley**-

**Harvey Mudd College**

This text is an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and computer programming.

(

**10357**views)

**Discrete Mathematics for Computer Science**

by

**Jean Gallier**-

**arXiv**

These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.

(

**14445**views)

**A Spiral Workbook for Discrete Mathematics**

by

**Harris Kwong**-

**Open SUNY Textbooks**

This textbook covers the standard topics in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics. It explains and clarifies the unwritten conventions in mathematics.

(

**6281**views)