Mathematics for Computer Science (Spring 2015) (M-I-T)

3.4.1 Generalized Counting Rules (M-I-T)

3.3.1 Sum And Product Rules (M-I-T)

3.4.3 Two Pair Poker Hands (M-I-T)

3.4.4 Binomial Theorem (M-I-T)

3.4.5 Multinomial Theorem (M-I-T)

3.5.1 The Pigeonhole Principle (M-I-T)

3.5.3 Inclusion-Exclusion Example (M-I-T)

3.5.4 Inclusion-Exclusion 2 Sets (M-I-T)

4.1.1 Tree Model (M-I-T)

4.1.3 Simplified Monty Hall Tree (M-I-T)

4.1.5 Sample Spaces (M-I-T)

4.2.1 Conditional Probability Definitions (M-I-T)

4.2.3 Law of Total Probability (M-I-T)

4.2.5 Bayes' Theorem (M-I-T)

4.6.1 Deviation From The Mean (M-I-T)

4.2.7 Monty Hall Problem (M-I-T)

4.6.3 Markov Bounds (M-I-T)

4.3.1 Independence (M-I-T)

4.6.5 Chebyshev Bounds (M-I-T)

4.3.3 Mutual Independence (M-I-T)

4.6.7 Variance (M-I-T)

4.4.1 Bigger Number Game (M-I-T)

4.7.1 Law Of Large Numbers (M-I-T)

4.4.2 Random Variables: Independence (M-I-T)

4.7.3 Independent Sampling Theorem (M-I-T)