Media Summary: In this video, we use the nearest-neighbor algorithm to find a Hamiltonian circuit for a given graph. For more info, visit the In this video, we learn the basic concepts we use to solve apportionment problems. Once you have watched this video, you're ... In this video, we learn how to use Adams' Method to solve apportionment problems. If you haven't yet watched the introduction ...

Math For Liberal Studies Using - Detailed Analysis & Overview

In this video, we use the nearest-neighbor algorithm to find a Hamiltonian circuit for a given graph. For more info, visit the In this video, we learn the basic concepts we use to solve apportionment problems. Once you have watched this video, you're ... In this video, we learn how to use Adams' Method to solve apportionment problems. If you haven't yet watched the introduction ... In this video, we learn how to use the Luhn algorithm to verify credit card ID numbers, and find missing check digits. For more ... In this video, we practice finding the plurality winner of an election, and determine whether or not that winner received a majority. In this video, we learn how to "eulerize" a graph: duplicating existing edges in a graph until it has an Euler circuit. For more info ...

Photo Gallery

Math for Liberal Studies: Using the Nearest-Neighbor Algorithm
Math for Liberal Studies - Lecture 2.4.1 The Borda Count
Math for Liberal Studies: Apportionment -- Introduction
Math for Liberal Studies - Lecture 3.1.1 Format and Validity
Math for Liberal Studies - Lecture 1.7.1 Maps and Colors
Math for Liberal Studies: Apportionment -- Adams' Method
Math for Liberal Studies: Rank Methods and the Borda Count
Math for Liberal Studies: The Luhn Algorithm
Math for Liberal Studies: Plurality and Majority
Math for Liberal Studies: Instant-Runoff Voting
Math for Liberal Studies - Lecture 2.2.1 Preference Lists
Math for Liberal Studies: "Eulerizing" a Graph
View Detailed Profile
Math for Liberal Studies: Using the Nearest-Neighbor Algorithm

Math for Liberal Studies: Using the Nearest-Neighbor Algorithm

In this video, we use the nearest-neighbor algorithm to find a Hamiltonian circuit for a given graph. For more info, visit the

Math for Liberal Studies - Lecture 2.4.1 The Borda Count

Math for Liberal Studies - Lecture 2.4.1 The Borda Count

This is the first video lecture for

Math for Liberal Studies: Apportionment -- Introduction

Math for Liberal Studies: Apportionment -- Introduction

In this video, we learn the basic concepts we use to solve apportionment problems. Once you have watched this video, you're ...

Math for Liberal Studies - Lecture 3.1.1 Format and Validity

Math for Liberal Studies - Lecture 3.1.1 Format and Validity

This is the first video lecture for

Math for Liberal Studies - Lecture 1.7.1 Maps and Colors

Math for Liberal Studies - Lecture 1.7.1 Maps and Colors

This is the first video lecture for

Math for Liberal Studies: Apportionment -- Adams' Method

Math for Liberal Studies: Apportionment -- Adams' Method

In this video, we learn how to use Adams' Method to solve apportionment problems. If you haven't yet watched the introduction ...

Math for Liberal Studies: Rank Methods and the Borda Count

Math for Liberal Studies: Rank Methods and the Borda Count

In this video, we practice

Math for Liberal Studies: The Luhn Algorithm

Math for Liberal Studies: The Luhn Algorithm

In this video, we learn how to use the Luhn algorithm to verify credit card ID numbers, and find missing check digits. For more ...

Math for Liberal Studies: Plurality and Majority

Math for Liberal Studies: Plurality and Majority

In this video, we practice finding the plurality winner of an election, and determine whether or not that winner received a majority.

Math for Liberal Studies: Instant-Runoff Voting

Math for Liberal Studies: Instant-Runoff Voting

In this video, we see some examples

Math for Liberal Studies - Lecture 2.2.1 Preference Lists

Math for Liberal Studies - Lecture 2.2.1 Preference Lists

This is the first video lecture for

Math for Liberal Studies: "Eulerizing" a Graph

Math for Liberal Studies: "Eulerizing" a Graph

In this video, we learn how to "eulerize" a graph: duplicating existing edges in a graph until it has an Euler circuit. For more info ...

Math for Liberal Studies - Lecture 2.7.1 The Apportionment Problem

Math for Liberal Studies - Lecture 2.7.1 The Apportionment Problem

This is the first video lecture for