This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. It explores the topics of basic combinatorics, number and graph theory, logic and proof techniques, and many more.
Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
| Pages : | : 1010 pages |
| Size : | |
| Downloads: | 28 |
| Created: | 2020-08-29 |
| License: | CC BY-SA 3.0 |
| Author(s): | Eric Lehman, F. Thomson Leighton, Albert R. Meyer |