Show:
Election Theory
Fair Division
Matrices
Graphs
Counting & Probability
100
This method bases the winner on the choice with the most 1st place rankings.
What is the plurality method.
100
What is the ideal ratio?
total/# seats
100
To add matrices, they must be the same _______________
size
100
If every vertex in a graph has an even degree, then a ____________________ exists.
Euler circuit
100
In a permutation, order ________________.
matters
200
This method's winner must have over half of the votes.
What is majority?
200
What is a quota?
class size / ideal ratio
200
When multiplying a 2x3 matrix by a 3x4 matrix, the result is a matrix of what size?
2x4
200
Any map that could be drawn on the surface of a sphere could be colored with, at most, ________ colors.
4
200
The addition rule for probability should be used when what word is used?
OR
300
This method multiplies the number of votes for each ranking by the number of points assigned to the ranking to find total points.
What is Borda count?
300
In the Hamilton method, any extra seats are given to the one with _______________
the largest decimal
300
Transpose means to _________________ the rows and columns.
switch
300
What kind of circuit hits every vertex once
Hamilton
300
Mutually exclusive means that two events have what in common?
no outcomes
400
The winner in this method must prove it can win against all other choices in a 1 to 1 contest.
What is the Condorcet method?
400
In the Jefferson method, the extra seats are given to the one whose ______________
JAR(Jefferson Adjusted Ratio) is closest to the ideal ratio.
400
1 2 3 4 5 6 7 8 9 What number is a21?
4
400
A tree is a connected graph with no ____________
cycles
400
Expected value can be found by multiplying each value by its probability and then _______________.
adding
500
This winner has probably been reassigned votes as each round eliminates one more choice.
What is sequential runoff method?
500
Which method uses the geometric mean?
the Hill method
500
Find the inverse of the matrix -3 5 -1 2
-2 5 -1 3
500
A spanning tree is a tree that contains every __________ vertex of the graph.
vertex
500
Find the binomial probability if n = 8, p = .65, and x = 5.
0.28