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- 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.
(16036 views)
Mathematics for Computer Scienceby Eric Lehman, F Thomson Leighton, Albert R Meyer - MIT
An introduction to discrete mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: sets, functions, number theory; Discrete structures: graphs, counting; Discrete probability theory.
(17436 views)
Discrete Math for Computer Science Studentsby 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.
(10513 views)
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.
(9752 views)