Math for Liberal Studies, 3rd Edition by James Hamblin

What's Here

This is the companion website for Math for Liberal Studies, 3rd Edition. In the table below, you can find a PowerPoint lecture for each section of the book. In addition, there are interactive online practice exercises for many sections, and video solutions for most problem types.

Unit 1: The Mathematics of Efficiency

Section	PowerPoint	Flash	Video Series
1.1	Paths and Models
1.2	Finding Euler Circuits
1.3	"Eulerizing" Graphs	Eulerize	Eulerizing Graphs
1.4	Hamiltonian Circuits	TSP Explore
1.5	Algorithms for Solving Graph Problems	Nearest Neighbor Sorted Edges	Nearest-Neighbor Algorithm Sorted-Edges Algorithm
1.6	Minimum Spanning Trees	MST	Kruskal's Algorithm
1.7	Coloring Graphs	Greedy Algorithm	Greedy Coloring Algorithm
1.8	Bin Packing and Scheduling	First-Fit Longest Processing Time	First-Fit and Best-Fit Algorithms Longest Processing Time
1.9	The Knapsack Problem

Unit 2: The Mathematics of Voting

Section	PowerPoint	Flash	Video Series
2.1	Controversial Elections		Plurality and Majority
2.2	The Number of Candidates Matters
2.3	The Condorcet Method	Plurality Voting Condorcet Voting	The Condorcet Method
2.4	Rank Methods	Borda Count	Rank Voting and Borda Count
2.5	Miscellaneous Methods	Contingent Voting Instant Runoff Voting	Contingent Voting Sequential Pairwise Voting Instant-Runoff Voting
2.6	Impossibility and Alternative Ballots	Approval Voting Range Voting
2.7	Apportionment	Hamilton's Method Jefferson's Method Adams' Method Webster's Method	Apportionment -- Introduction Hamilton's Method Jefferson's Method Adams' Method Webster's Method
2.8	Weighted Voting Systems
2.9	Power Indices	Shapley-Shubik Power Index Banzhaf Power Index	Shapley-Shubik Power Index Banzhaf Power Index

Unit 3: The Mathematics of Information

Section	PowerPoint	Flash	Video Series
3.1	Identification Numbers
3.2	Using Check Digits	Money Orders 1 Money Orders 2
3.3	More Check Digit Systems	UPC Check Digits 1 UPC Check Digits 2 Routing Numbers 1 Routing Numbers 2 ISBN 1 ISBN 2 Luhn Algorithm 1 Luhn Algorithm 2	Luhn Algorithm
3.4	Bar Codes	POSTNET 1 POSTNET 2 POSTNET 3 UPC Bar Codes 1 UPC Bar Codes 2
3.5	Error-Correcting Codes
3.6	An Introduction to Cryptography	Caesar 1 Caesar 2 Bifid 1 Bifid 2	Bifid Encoding Bifid Decoding
3.7	Modular Arithmetic and Ciphers	Vigenère 1 Vigenère 2 Autokey 1 Autokey 2
3.8	More Modular Arithmetic and Public-Key Cryptography

This page last updated 3/5/14 1:07 PM by JH.