Selected topics in finite mathematics

Completion status: this resource is ~25% complete.

Subject classification: this is a mathematics resource.

A Graph

Finite Mathematics falls within the realm of Discrete Mathematics. This course will serve as a guide through the selected topics listed below.

• Graphs
• Operations Research
• Logic and Sets
• Voting
• Financial Mathematics
• Probability
• Statistics

Module 1: Graphs and Optimization

1. What is a graph?
2. Eulerian cycles
3. Hamiltonian cycles
4. Minimum spanning trees
5. Graph coloring
6. Maximum flow
7. Trees
8. Directed graphs
9. Bin packing
10. Linear programming
11. Transportation problems

Module 2: Logic, Arguments, and Voting

1. Sets, logic, and arguments
2. Voting with preference schedules
   1. Plurality
   2. Condorcet method
   3. Borda count
   4. Sequential runoffs
   5. Sequential pairwise elections
3. Fairness criteria
   1. Condorcet criterion
   2. Dropout criterion
   3. Majority criterion
   4. Independent of irrelevant alternatives
   5. Pareto condition
   6. Monotonic
4. Approval voting
5. Weighted voting
6. Coalitions
7. Voting power

Module 3: Mathematics in money and ??

1. Managing your money
2. Taxes

Construction

Main article: Selected topics in finite mathematics/Construction

This Wikiversity will be constructed primarily between January and April 2012. If you're a participant and haven't edited a wiki before, you might try reading Wikiversity:Introduction for an introduction. Once you know how to navigate and edit the lessons above will be at your fingertips. You can read them to refine your understanding. Expand the lesson to master the material. Add examples where you can. Ask questions when you need, answer questions when you can. And remember to be bold!

See the Construction page for a list of items that need attention.