The apportionment problem asks how to assign representation to states based on their populations. That is, given census data and a fixed number of seats, how many seats should each state be assigned? Various algorithms exist to solve the apportionment problem, but by the Balinski-Young Impossibility Theorem, every such algorithm will be flawed in some way. This paper focuses on divisor methods of apportionment, where the possible flaws are known as quota violations. This paper presents a detailed analysis of quota violations that can arise under divisor methods for three states, By focusing on the three-state case, the paper makes the consequences of the Balinski-Young theorem particularly transparent and allows for a precise classification of quota violations that is difficult to obtain in more general formulations. The study focuses on quota violations in the Adams, Jefferson, Dean, and the Huntington-Hill methods when allocating M seats, but is expandable to a wider class of divisor functions. Theoretical results are proved about the behavior of these methods, particularly focusing on the types of quota violations that may occur, their frequency, and their structure and geometry. The key results of the paper are tests to detect quota violations which are employed to understand the geometry of violations and construct a probability function which calculates the likelihood of such violations occurring given an initial three state population vector whose components follow varying distributions.