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
![Book cover: Applied Discrete Structures](images/9735.jpg)
by Al Doerr, Ken Levasseur - Lulu.com
Applied Discrete Structures is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures.
(9037 views)
![Book cover: Discrete Math for Computer Science Students](images/10940.jpg)
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.
(10086 views)
![Book cover: A Spiral Workbook for Discrete Mathematics](images/10996.jpg)
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.
(7491 views)
![Book cover: Discrete Mathematics with Algorithms](images/8957.jpg)
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...
(10541 views)