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
Temporal Networksby Petter Holme, Jari Saramäki - arXiv
In this review, the authors present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamic systems.
(7932 views)
Topics in Discrete Mathematicsby 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.
(6192 views)
Elementary Computer Mathematicsby 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.
(6974 views)
Discrete Mathematics- Wikibooks
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. This book will help you think well about discrete problems: problems where tools like calculus fail because there's no continuity.
(10205 views)