# Discrete Math

Discrete mathematics is concerned with sets of elements that are finite, or countable. This is contrary to many mathematical fields, which deal with infinite processes or the infinite set of real numbers. An important part of discrete math, and main focus of this course, has to do with algorithms, which are specific instructions for performing certain computations.

Curriculum
Graph Theory
• PERT Graphs
• Vertices/Edges
• Euler Circuits and Paths
• Connected and Complete Graphs

Voting Theory
• Plurality and Majority Elections
• Borda Count
• Runoff and Sequential Runoff Elections

Apportionment
• Hamilton Method
• Jefferson Method
• Extensions and other Apportionments

Fair Division
• Divider Chooser
• Extensions of Division
• Sealed Bids and Estate Division

Matrices
• Matrix Theory and Definitions
• Applications: System of Equations, Population Growth, Economic Theory

Probability
• Counting Principal
• Combinations and Permutations
• Dependent and Independent Probability
• Binomial Probability

Sequences and Series
• Arithmetic Sequence and Series
• Geometric Sequence and Series
• Applications: Financial Algebra