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
Exploring Discrete Mathematics Using Mapleby Kenneth H. Rosen - Mcgraw-Hill College
This is a guide to help you explore concepts in discrete mathematics using the computer system Maple. It is designed to be accessible to those who are complete novices with Maple and with computer programming, but it has much to offer even experts.
(9920 views)
Discrete Mathematicsby W W L Chen - Macquarie University
Logic and sets, the natural numbers, division and factorization, languages, finite state machines, finite state automata, Turing machines, groups and modulo arithmetic, introduction to coding theory, group codes, public key cryptography, etc.
(30566 views)
Discrete Mathematics for Computer Scienceby 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.
(16917 views)
Discrete Mathematics with Algorithmsby 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...
(11391 views)