Mathematics in context exam 3 notes, Lecture notes of Elementary Mathematics

Great notes for exam 3! Would recommend

Typology: Lecture notes

2025/2026

Available from 04/24/2026

sara.liza
sara.liza 🇺🇸

12 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1. Voting Systems
Plurality Method
Step 1: Look at first choice votes only.
Step 2: Find the biggest number.
That person wins.
Practice question:
First choice votes: D=26, E=27, F=28, H=29
H has 29. Answer: Hawking (H)
Borda Count
For 3 candidates:
1st place = 3 points
2nd place = 2 points
3rd place = 1 point
Add the points for each person. Highest total wins.
Plurality with Elimination
Step 1: Find person with fewest votes.
Step 2: Remove that person.
Step 3: Repeat with remaining people until one has more than half the votes.
2. Statistics
Mean
Add all numbers. Divide by how many numbers there are.
Frequency table example (from your notes):
Scores: 1, 2, 3, 4, 5, 6, 7, 8
Frequency: 2+, 4,+ 3, +4,+ 5, +4,+ 2, +3
Do: (1×2) + (2×4) + (3×3) + (4×4) + (5×5) + (6×4) + (7×2) + (8×3) = 122
Total frequency = 27
Mean = 122 ÷ 27 = 4.52
Median
Put numbers in order from smallest to biggest.
If odd number of values: middle one.
If even: add the two middle numbers and divide by 2.
Mode
The number that appears the most times.
Midrange
(lowest number + highest number) ÷ 2
3. Probability & Combinatorics
Combination (order does not matter)
Use formula: n! / (k! × (n-k)!)
Example from your notes: 45! / (7! × 38!) = 45,379,620
Probability
Favorable outcomes ÷ total possible outcomes.
Example: 4 good outcomes out of 36 = 4/36 = 1/9
pf2

Partial preview of the text

Download Mathematics in context exam 3 notes and more Lecture notes Elementary Mathematics in PDF only on Docsity!

  1. Voting Systems Plurality Method Step 1: Look at first choice votes only. Step 2: Find the biggest number. That person wins. Practice question: First choice votes: D=26, E=27, F=28, H= H has 29. Answer: Hawking (H) Borda Count For 3 candidates: 1st place = 3 points 2nd place = 2 points 3rd place = 1 point Add the points for each person. Highest total wins. Plurality with Elimination Step 1: Find person with fewest votes. Step 2: Remove that person. Step 3: Repeat with remaining people until one has more than half the votes.
  2. Statistics Mean Add all numbers. Divide by how many numbers there are. Frequency table example (from your notes): Scores: 1, 2, 3, 4, 5, 6, 7, 8 Frequency: 2+, 4,+ 3, +4,+ 5, +4,+ 2, + Do: (1×2) + (2×4) + (3×3) + (4×4) + (5×5) + (6×4) + (7×2) + (8×3) = 122 Total frequency = 27 Mean = 122 ÷ 27 = 4. Median Put numbers in order from smallest to biggest. If odd number of values: middle one. If even: add the two middle numbers and divide by 2. Mode The number that appears the most times. Midrange (lowest number + highest number) ÷ 2
  3. Probability & Combinatorics Combination (order does not matter) Use formula: n! / (k! × (n-k)!) Example from your notes: 45! / (7! × 38!) = 45,379, Probability Favorable outcomes ÷ total possible outcomes. Example: 4 good outcomes out of 36 = 4/36 = 1/
  1. Apportionment – Hamilton’s Method Steps (use exactly these)
  2. Add all populations = total population.
  3. Total seats ÷ total population = standard divisor.
  4. For each state: population ÷ divisor = quota.
  5. Give each state the whole number part (floor).
  6. Add those whole numbers.
  7. Subtract from total seats → remaining seats.
  8. Give the remaining seats to the states with the biggest decimal parts (one at a time). Your 4-state practice Populations: A=92, B=104, C=196, D=228. Total=620. Seats=31. Divisor = 620 ÷ 31 = 20 Quotas: A=4.6, B=5.2, C=9.8, D=11. Whole numbers: 4 + 5 + 9 + 11 = 29 Remaining = 2 seats Biggest decimals: C (0.8) then A (0.6) Final: A=5, B=5, C=10, D=
  9. Apportionment – Jefferson’s Method Steps They give you the divisor to use. For each state: population ÷ given divisor Take only the whole number part (round down). The total should equal the number of seats. Your 5-state practice (divisor = 32,920, seats=60) A: 138691 ÷ 32920 = 4.21 → 4 B: 217946 ÷ 32920 = 6.62 → 6 C: 413143 ÷ 32920 = 12.55 → 12 D: 571058 ÷ 32920 = 17.35 → 17 E: 723565 ÷ 32920 = 21.98 → 21 Total = 60 (correct)
  10. Graph Theory Adjacent vertices Two points connected by a line. Bridges An edge (line) that, if you remove it, the graph splits into separate pieces. Step: Look at each line. If removing it breaks the graph, it is a bridge. Tree The graph is connected (all points reachable) AND has no loops (no circles). Practice question answer: The graph is a tree. Euler Path or Circuit Count how many lines touch each point (degree).
  • 0 points with odd number of lines → Euler Circuit
  • Exactly 2 points with odd number → Euler Path
  • 3 or more odd → neither Hamilton Path A path that visits each point exactly once. Your note: Vertex Q counts as +2. Follow path and (+).