The Kemeny Lectures on Finite Mathematics

John G. Kemeny

Version 0.1, 2 April 1998
Copyright (C) 1983-1998 Anne Huggins
This work is freely redistributable under the terms of
the GNU General Public License
as published by the Free Software Foundation.
This work comes with ABSOLUTELY NO WARRANTY.

• Compound statements and truth tables
• Example: equivalence and implication
• Introduction to tree diagrams
• Excerpt: Professor Snell and the urn
• Set operations (review)
• Counting problems
• Partitions and binomial coefficients
• What is 0!?
• Partitions and binomial coefficients (review)
• How many subsets?
• Pascal's triangle
• Binomial coefficients and Pascal's triangle (review)
• Introduction to probability
• Introduction to probability (review)
• Simulation in probability
• Two examples: binomial coefficients and odds
• The birthday problem
• Conditional probability (preview)
• Advice on exam-taking
• To add, or to multiply?
• Conditional probability
• Conditional probability (review)
• Venn diagram probability examples
• Example: true-false test strategy
• Example: gerrymandering
• Example: false positives and false negatives
• Coin tossing (preview)
• Coin tossing and binomial probabilities
• Coin tossing and binomial probabilities (review)
• Example: onditional probabilities by reversing the tree
• Example: getting exactly half heads
• Example: take the negation
• Plotting binomial probabilities; introduction to CLT
• The Central Limit Theorem
• Excerpt: applications of the CLT
• GAME DELAYED--DOG ON FIELD