Notes onDiscrete Mathematics
Miguel A. Lerma
Contents
Introduction 5Chapter 1. Logic, Proofs 61.1. Propositions 61.2. Predicates, Quantifiers 111.3. Proofs 13Chapter 2. Sets, Functions, Relations 192.1. Set Theory 192.2. Functions 272.3. Relations 32Chapter 3. Algorithms, Integers 383.1. Algorithms 383.2. The Euclidean Algorithm 483.3. Modular Arithmetic, RSA Algorithm 52Chapter 4. Induction, Recurences 594.1. Sequences and Strings 594.2. Mathematical Induction 624.3. Recurrence Relations 65Chapter 5. Counting 695.1. Basic Principles 695.2. Combinatorics 715.3. Generalized Permutations and Combinations 735.4. Binomial Coefficients 755.5. The Pigeonhole Principle 77Chapter 6. Probability 786.1. Probability 78Chapter 7. Graph Theory 827.1. Graphs 827.2. Representations of Graphs 887.3. Paths and Circuits 91
3
Search History:
Result 00 of 00
00 results for result for
p.
A.1. Efficient Computation of Powers Modulo m for Notes on Discrete M.
These notes are intended to be a summary of the main ideas in
course CS 310: Mathematical Foundations of Computer Science. I
may keep working on this document as the course goes on, so these
notes… (More)
course CS 310: Mathematical Foundations of Computer Science. I
may keep working on this document as the course goes on, so these
notes… (More)
809
Reads
8
Readcasts
1
Embed Views
More From This User
Notes
Load more
