📚 The US Constitution: Mathematical Allocation of Congressional Seats | 美国宪法：国会席位的数学分配
The United States Constitution mandates that seats in the House of Representatives be apportioned among the states according to their respective populations. While this sounds straightforward, achieving a fair and proportional allocation is a profound mathematical challenge that has sparked debates and algorithm refinements for over two centuries. This article explores the mathematics behind congressional apportionment, linking it to concepts in A-Level Mathematics such as ratio, proportion, algorithms, and fairness criteria.
美国宪法规定，众议院席位应按各州人口比例分配。尽管这听起来简单明了，实现公平且成比例的分配却是一个深刻的数学难题，两百多年来不断引发辩论和算法改进。本文探讨国会席位分配背后的数学，并将其与A-Level数学中的比例、比率、算法以及公平性准则等概念联系起来。
1. The US Constitution and the House of Representatives | 美国宪法与众议院
Article I, Section 2 of the US Constitution establishes that each state shall have at least one Representative, with the remaining seats distributed according to population. A decennial census (taken in years ending in '0') determines the population counts, after which a total of 435 seats must be apportioned. The Constitution does not specify the mathematical method to be used, leaving room for political and mathematical controversy.
美国宪法第一条第二款规定，每个州至少有一名众议员，其余席位按人口分配。每十年一次的人口普查（公元年末位为0的年份）决定各州人口数，随后必须将总共435个席位分配完毕。宪法并未规定使用的数学方法，这就为政治和数学争议留下了空间。
2. The Apportionment Problem | 分配问题
At its core, the apportionment problem is: given S seats and n states with populations P₁, P₂, …, Pₙ, determine integers a₁, a₂, …, aₙ (the number of seats each state receives) such that Σaᵢ = S, and each aᵢ is 'as proportional as possible' fferent rules lead to different allocations and can violate intuitive notions of fairness.
分配问题的核心是：给定 S 个席位和 n 个州，人口分别为 P₁, P₂, …, Pₙ，求出每个州获得的整数席位 a₁, a₂, …, aₙ，使得 Σaᵢ = S，且每个 aᵢ 尽可能与人口成比例。州 i 的理想配额为 Qᵢ = Pᵢ × S / ΣP。由于配额极少为整数，必须选择一种舍入规则。不同的规则会导致不同的分配结果，并可能违反人们直觉上的公平性。
3. Hamilton's Method: Largest Remainders | 汉密尔顿方法：最大余数法
e to the states with the largest fractional remainders. It is simple and was used for the 1850–1900 apportionments. However, it suffers from paradoxes. Mathematically, for state i: aᵢ = ⌊Qᵢ⌋ + rᵢ, where rᵢ = 1 for the states with the largest fractional parts of Qᵢ − ⌊Qᵢ⌋ until the total seats equal S.
该方法由亚历山大·汉密尔顿提出，首先给每个州分配其配额的整数部分（下取整），然后将剩余席位逐一分配给余数最大的州。方法简单，曾用于1850至1900年的席位分配。但它存在悖论。数学上，对于州 i：aᵢ = ⌊Qᵢ⌋ + rᵢ，其中 rᵢ 对 Qᵢ − ⌊Qᵢ⌋ 小数部分最大的州取1，直到总席位达到 S。
4. Jefferson's Method: Divisor with a Lower Quota | 杰斐逊方法：降低基数除数法
Thomas Jefferson proposed adjusting the divisor d so that when each state' d and rounded down, the sum of the results equals S exactly. That is, choose d such that Σ⌊Pᵢ/d⌋ s because it lowers the divisor until enough seats are generated, systematically giving more seats to states with larger populations. It was used from 1792 to 1830.
托马斯·杰斐逊提出调整除数 d，使得将各州人口除以 d 并向下取整后的总和恰好等于 S。即选择 d 使得 Σ⌊Pᵢ/d⌋ = S。该方法偏向大州，因为它降低除数以产生足够席位，系统性地给人口较多的州更多席位。此法于1792至1830年间使用。
5. The Alabama Paradox | 阿拉巴马悖论
A notorious flaw of Hamilton's method is the Alabama paradox: increasing the total number of seats S can cause a state to lose a seat. In 1880, it was discovered that allocating 299 seats gave Alabama 8 seats, but with 300 total seats, Alabama's allocation dropped to 7. This violates the principle of monotonicity: no state's seat count should decrease when the house size increases.
汉密尔顿方法的一个著名缺陷是阿拉巴马悖论：增加总席位数 S 可能导致某个州失去一个席位。1880年发现，分配299个席位时阿拉巴马州获得8席，但总席位增至300时，阿拉巴马州的席位反而降至7席。这违反了单调性原则：议院规模扩大时，任何州的席位数不应减少。
6. Webster's Method: Rounding at the Arithmetic Mean | 韦伯斯特方法：算术平均舍入
Daniel Webster' ntegers sum to S. This corresponds to the concept of the arithmetic mean and tends to be balanced between large and small states. It was used in 1840 and 1910.
丹尼尔·韦伯斯特的方法使用除数法，以0.5为界进行四舍五入。我们寻找一个除数 d，使得将每个 Pᵢ/d 正常舍入（小数部分 ≥ 0.5 则上入，否则下舍）后，舍入后的整数之和等于 S。这对应算术平均的概念，在大州和小州间趋向平衡。曾在1840年和1910年使用。
7. The Huntington-Hill Method: Equal Proportions | 亨廷顿-希尔方法：相等比例
so known as the method of equal proportions. It uses a divisor adjusted so that each state' are assigned one by one to the highest priority values. This method avoids the Alabama paradox and treats all states fairly under the equal proportions criterion.
自1941年起，美国一直采用亨廷顿-希尔方法，即等比例方法。它调整除数，使得各州的分配席位 aᵢ 满足：基于几何平均数 √(n(n−1)) 作为舍入阈值，令各州人均代表差异最小化。实际操作中，计算优先值 Aᵢ = Pᵢ/√(aᵢ(aᵢ − 1))，席位逐一分配给优先值最高的州。该方法避免了阿拉巴马悖论，并在等比例准则下公平对待所有州。
8. Mathematical Fairness and the Constitution | 数学公平与宪法
The Constitution does not define 'proportional' mathematically, leaving it to Congress. Over time, mathematical interpretations of fairness have evolved. Quota violations (when a state receives fewer than its lower quota or more than its upper quota) and population paradoxes (a faster-growing state loses a seat to a slower-growing one) forced the shift from Hamilton's method to divisor methods. The Huntington-Hill method ensures that the ratio of representatives to population is as consistent as possible across states, aligning with the 'one person, one vote' ideal.
宪法并未在数学上定义“成比例”，这留给了国会。随着时间推移，公平性的数学解释不断演变。配额违规（某州获得少于下配额或多于上配额）和人口悖论（增长更快的州反而将席位输给增长较慢的州）迫使从汉密尔顿方法转向除数法。亨廷顿-希尔方法确保各州代表与人口之比尽可能一致，符合“一人一票”的理想。
9. Population Shifts and Reapportionment | 人口变动与再分配
Every decade, new census data trigger a reapportionment: states may gain or lose seats. Mathematically, this is a re-solving of the same allocation problem with updated Pᵢ values. Interestingly, the method used can affect which states gain or lose. For example, under Hamilton's method, a small change in population could flip a seat between two states due to the largest remainder tie-breaking, while Huntington-Hill's geometric mean smoothing makes such flips less arbitrary.
每十年，新的人口普查数据会触发再分配：各州可能获得或失去席位。从数学上讲，这是使用更新的 Pᵢ 数值重新解决相同的分配问题。有趣的是，所用方法能影响哪些州增减席位。例如，在汉密尔顿方法下，人口的微小变化可能因最大余数的平局决胜导致席位在两州间易手；而亨廷顿-希尔方法的几何平均平滑使得这种转换更少随意性。
10. Worked Example: Applying Methods to a Small State Scenario | 实例应用：小州情景应用各方法
ations P₁ = 250, P₂ = 400, P₃ = 350. Total P = 1000. Quotas: Q₁ = 2.5, Q₂ = 4.0, Q₃ = 3.5.
我们用简化例子说明：总席位 S = 10，三个州的人口为 P₁ = 250, P₂ = 400, P₃ = 350。总人口 P = 1000。配额：Q₁ = 2.5, Q₂ = 4.0, Q₃ = 3.5。
Hamilton: First, floor allocations: 2, 4, 3 (sum 9). Remainders: 0.5, 0, 0.5. One seat left; the states with largest remainders are states 1 and 3 (tie 0.5). Typically alphabetical or arbitrary tiebreak; suppose state 1 gets the extra seat. Final: 3, 4, 3 seats.
汉密尔顿方法：首先下取整分配：2, 4, 3（总和9）。余数：0.5, 0, 0.5。剩余一席，余数最大的州为州1和州3（均为0.5）。通常按字母顺序或任意决胜；假设州1获得额外席位。最终：3, 4, 3席。
Jefferson: 2,4,4. Jefferson favours the larger states: state 3 (350) gains a seat over state 1 (250).
杰斐逊方法：尝试除数 d 小于100。取 d=95，下取整(P/d)：250/95=2.63→2；400/95=4.21→4；350/95=3.68→3，总和9。d=90：2.77→2；4.44→4；3.88→3总和9。d=85：2.94→2；4.70→4；4.11→4总和10。因此d=85时得2,4,4。杰斐逊方法偏向较大州：州3（350）比州1（250）多获一席。
Webster: Need divisor d so sum of rounded (P/d) = 10. d=100 gives quotas rounded: 2.5→3? d=108 yields: 2.31→2, 3.70→4, 3.24→3 sum=9. No divisor gives exactly 10 with this rounding? Let' 4, 3.46→3 sum=9. d=99: 2.52→3, 4.04→4, 3.53→4 sum=11. So it seems impossible to get sum 10? e is a value where sum crosses 10, but because rounding is a step function, sum might jump from 9 to 11 without hitting 10. In such cases, a modified procedure is used, but this illustrates the challenge. Suppose we take d such that one state' ter may fail to produce exact sum for some data, but in real apportionment, the divisor is chosen to reach exactly S by tweaking. The example shows the inherent integer constraint.
韦伯斯特方法：需要除数 d 使得四舍五入(P/d)之和 = 10。d=100 四舍五入后：2.5→3（韦伯斯特将0.5上入），4→4，3.5→4，总和11太高。尝试d=105：2.38→2, 3.81→4, 3.33→3总和9。d=102：2.45→2, 3.92→4, 3.43→3总和9。d=98：2.55→3, 4.08→4, 3.57→4总和11。需总和10。但可能跳跃从9到11，无精确10。实际中会微调除数实现，但本例显示整数约束的挑战。取d≈100.5：2.48→2, 3.98→4, 3.48→3总和9。本例韦伯斯特可能无法精确达到10，但真实分配时会通过算法精确分配。这展现了除数法的复杂性。
Huntington-Hill: ng 7 seats distributed by priority. Formula A = P/√(a(a-1)). For state 1, a=1: denominator √1×0 each state automatically. After each has 1 seat, we compare priorities for a=2: A₁(2)=250/√2×1 14=247.5. Highest is state 2, gets 2nd seat. Then recalc priorities: state 2 now a=3: 400/√3×2 te 1 (176.8) and state 3 (247.5). Next highest state 3 gets 2nd seat. Then state 1 gets 2nd seat (176.8 > 163.3). Continue assigning seats this way until all 10 allocated. This yields a result that is currently used to allocate US House seats, avoiding paradoxes.
亨廷顿-希尔方法：计算各州的优先值，从a=1开始（因为每州至少一席）。初始每州一席。剩余7席按优先值分配。公式 A = P/√(a(a-1))。州1 a=1时分母为0，优先值无限大，因此前三席自动分配给各州。之后比较a=2时的优先值：A₁(2)=250/√2≈176.8，A₂(2)=400/√2≈282.8，A₃(2)=350/√2≈247.5。最高为州2，获第2席。然后重算州2 a=3：400/√6≈163.3，与州1的176.8和州3的247.5比较。最高州3获第2席。接着州1获第2席（176.8 > 163.3）。如此继续，直至10席全部分配。结果避免了悖论，是目前美国众议院所用的方法。
Below is a summary table of the final allocations for the example:
以下为示例最终分配的汇总表：
| Method / 方法 | State 1 (250) | State 2 (400) | State 3 (350) |
|---|---|---|---|
| Hamilton | 3 | 4 | 3 |
| Jefferson | 2 | 4 | 4 |
| Webster | 2* | 4 | 4 |
| Huntington-Hill | 2 | 4 | 4 |
(*Webster's method may require a tie-breaking rule to reach exactly 10 seats in this artificial example; typical implementation would allocate 2,4,4 with a divisor near 85–90 under rounding conventions.)
（*在此人工示例中，韦伯斯特方法可能需要平局决胜规则才能恰好达到10席；实际实施通常会采用与杰斐逊类似的结果2,4,4。）
11. Implications for A-Level Mathematics | 对A-Level数学的启示
The apportionment problem illustrates core mathematical themes: discrete allocation, optimisation, and algorithm design. Edexcel A-Level Mathematics students can see connections to inequalities (quota bounds), sequences (geometric mean), and statistical reasoning (proportionality). Understanding these methods deepens appreciation for how mathematics governs democratic structures, demonstrating that behind a constitutional clause lies a rich tapestry of mathematical thought.
分配问题展示了核心数学主题：离散分配、优化以及算法设计。Edexcel A-Level数学的学生可以看到它与不等式（配额界限）、数列（几何平均数）以及统计推理（比例）的联系。理解这些方法能加深对数学如何治理民主结构的认识，表明一条宪法条款背后蕴含着丰富的数学思想。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图