📚 Changing Places | 换位问题
In counting problems, the concept of 'changing places' refers to rearranging objects or people so that their positions are altered. From simple swaps in a line to coordinated shifts around a circle, this idea underlies much of permutations and combinations in Edexcel A-Level Mathematics. Mastering these scenarios means understanding restrictions, fixed points, and the art of counting without omission or repetition.
在计数问题中，“换位”这一概念指的是重新排列物体或人，使他们所处的位置发生改变。从直线排列中的简单交换到圆桌旁的协同移位，这一思想是爱德思A-Level数学中排列组合大部分内容的基础。掌握这些情境意味着要理解限制条件、不动点，以及不重不漏的计数艺术。
1. Introduction to Changing Places | 换位问题简介
A group of n distinct items can be arranged in n! different orders. Every such arrangement can be seen as a unique way of assigning each item to a numbered place. 'Changing places' simply means adopting a different assignment—either by swapping two items, cycling several places, or completely reshuffling the order.
n个互不相同的物品可以排列成 n! 种不同的顺序。每一种排列都可以看作将每个物品分配到一个编号位置上的独特方式。“换位”仅仅意味着采取一种不同的分配——无论通过交换两个物品、循环移动几个位置，还是彻底重新洗牌。
In exam questions, constraints are often applied: some objects may be fixed in a given place, some must not stand next to each other, or some must always be together. Such conditions transform the simple factorial count into more subtle problems of changing places subject to rules.
在考题中常会施加约束：有些物体可能被固定在指定位置，有些不得相邻而立，有些则必须始终在一起。这些条件将简单的阶乘计数变成了遵循规则进行换位的更精细的问题。
The ability to translate a 'changing places' scenario into a standard permutation or combination model is essential. We shall explore a spectrum of models—linear, circular, restricted, and extreme cases like derangements where nothing stays put.
将“换位”情境转化为标准排列或组合模型的能力至关重要。我们将探讨一系列的模型——线性的、圆形的、带限制的，以及像错排那样没有任何物体留在原位的极端情况。
2. Basic Permutations Without Restrictions | 无限制的基本排列
inct objects are to be placed in n distinct positions, the number of ways is n × (n − 1) × … × 1 = n! ilable for the second, and so on. This represents the complete freedom of changing places.
当 n 个互不相同的物体要放置到 n 个不同位置上时，方法数为 n × (n – 1) × … × 1 = n!。为第一个物品选择一个位置后，剩下 n – 1 个可用位置给第二个物品，依此类推。这代表了换位的完全自由。
For example, five students changing seats in a row of five chairs can do so in 5! = 120 ways. Every arrangement is a new 'places' configuration. The factorial operation is the foundation for all more elaborate counting.
例如，五名学生在五个座位的一排椅子上换座位，可以有 5! = 120 种方式。每一种排列都是一种新的“位置”配置。阶乘运算是所有更复杂计数的基础。
Number of permutations of n distinct objects = n!
n 个互异物体的排列数 = n!
3. Permutations with Fixed Positions | 固定位置的排列
Often some objects are not allowed to change places—they must stay where they are. If r specific items are fixed, we treat them as immovable anchors. The remaining n − r items can be permuted freely among the remaining n − r places in (n − r)! ways.
通常有些物体不允许换位——它们必须留在原处。如果有 r 个特定的物品被固定，我们就将它们视为无法移动的锚点。剩下的 n – r 个物品则在其余的 n – r 个位置中自由排列，共有 (n – r)! 种方式。
on a shelf where the first and last books are predetermined leaves the middle five books to change places in 5! ys. This idea extends to fixing objects in certain positions while the rest change places.
举例来说，把七本书放在书架上，若第一本和最后一本已经事先确定，那么中间的五本书可以换位，有 5! = 120 种方式。这一思想可以推广到固定某些位置的物体、而让其余物体换位的情形。
4. Changing Places: Swapping Objects | 交换位置：物体互换
A simple swapping of two items is the smallest possible change of places. If we ask for the number of permutations where two named individuals, A and B, switch seats while everyone else may or may not move, we often count relative to a reference arrangement.
最简单的换位是两个物品的直接交换。如果要问有两个指定的人 A 和 B 互换座位、而其他人可能移动也可能不动的排列数，我们通常要相对于一个参考排列来计数。
But the more practical examination question is: 'In how many ways can n people be arranged so that A and B are not in their original positions?' This leads to counting arrangements where specific elements change places, often solved by complementary counting or inclusion-exclusion.
但更实际的考题是：“n 个人有多少种排列方式，使得 A 和 B 都不在原来的位置上？”这将引向计算特定元素换位的排列数，通常可以通过补集计数或容斥原理来解决。
5. Arrangements with Restrictions: Not All Objects Can Change | 有限制条件的排列：并非所有物体都可换位
Some items may be restricted to a subset of positions: e.g., three particular trophies cannot be placed on the top shelf. We first assign restricted items to allowed positions, then freely permute the rest. This 'place-first, then arrange' strategy is powerful for 'changing places' under constraints.
有些物品可能被限制只能放在某些位置中：例如三个特定的奖杯不能放在顶层架子上。我们先把受限物品分配到容许的位置，然后自由排列其余物品。这种“先分配位置，再排列”的策略对带约束的“换位”问题非常有效。
Similarly, when objects must be kept together (as a block), we treat the block as a single unit, permute the units, then permute within the block. The block itself can change places relative to other units, but its internal order can also vary.
类似地，当物体必须被保持在一起（集合在一起作为一个块）时，我们将该块视为一个单元，排列各单元，然后在块内进行排列。这个块本身可以相对于其他单元换位，而其内部顺序也可以变化。
| Scenario | Method | Example count (n=5) |
|---|---|---|
| A and B together | Treat AB as block: 2! × 4! | 2 × 24 = 48 |
| A and B not adjacent | Total − (A & B adjacent) | 120 − 48 = 72 |
| A must be before B | ½ × total permutations | ½ × 120 = 60 |
These symmetrical restrictions halve or partition the set of all place changes. Edexcel exam questions frequently test these 'at least one', 'exactly one', or 'none' conditioned counts.
这些对称性限制会将所有换位构成的集合平分或划分。爱德思考题经常测试“至少一个”、“恰有一个”或“无一”的条件计数。
6. Circular Permutations: Changing Places Around a Table | 圆排列：圆桌周围的换位
When objects are arranged in a circle, places are considered identical under rotation. The number of distinct circular arrangements of n distinct objects is (n − 1)! . Changing places in a circle means fixing one item as a reference (to remove rotational symmetry) and then permuting the rest.
当物体被排列成一个圆时，位置在旋转下视为相同。n 个互异物体的不同圆排列数为 (n – 1)!。在圆中换位意味着固定一个物体作为参照（以消除旋转对称性），然后排列其余的物体。
raint. For 8 people with A and B opposite, fix A, place B opposite (1 way); arrange the remaining 6 in 6! ways. Thus the count is 6! = 720.
如果加上额外的限制，比如两个人在偶数座位的圆桌上必须相对而坐，我们就把这对人当作一个直径约束。对于 8 个人，要求 A 与 B 相对：固定 A，把 B 放在对面（仅1种方式）；其余 6 人按 6! 排列。总数为 6! = 720。
7. Combinations and Changing Places | 组合与换位
While permutations focus on ordering—hence directly on changing places—combinations remove the order and simply ask which objects are selected. Yet combinations can be useful when only certain 'positions' are chosen for a subset that will then change places among themselves.
虽然排列关注顺序——从而直接与换位相关——组合则忽略顺序，只问哪些物体被选中。但当某个子集先选出一些“位置”、然后在这些位置中彼此换位时，组合就可以派上用场。
A classic example: From 10 players, select a goalkeeper, 4 defenders, 3 midfielders and 2 forwards. The positions are distinct, so after choosing, players change places within their position group by permuting assignments.
一个经典的例子：从 10 名球员中选出一个守门员、四个后卫、三个中场和两个前锋。这些位置都是不同的，因此在选定后，球员会在各自的位置组内通过排列分配来换位。
Ways = C(10,1) × C(9,4) × C(5,3) × C(2,2) × (4! × 3! × 2!)
方法数 = C(10,1) × C(9,4) × C(5,3) × C(2,2) × (4! × 3! × 2!)
8. The Inclusion-Exclusion Principle in Place Changing | 容斥原理在换位中的应用
When we need to count arrangements in which none of several specified items end up in their original places, inclusion-exclusion provides a systematic approach. Start with total permutations, subtract those where at least one item is fixed, add back overlaps, and so on.
当我们需要计算多个指定物品无一留在原来位置的排列数时，容斥原理提供了一个系统的方法。从总排列数开始，减去至少一个物品被固定的排列数，加回重叠部分，依此类推。
of ways 4 people can change seats such that no one sits in their original seat. Total = 4! = 24. Let Aᵢ be the event person i is fixed. Then count |A₁ ∪ A₂ ∪ A₃ ∪ A₄| and subtract from 24 to get derangements: 9.
例如，求 4 个人的换座位方式，使得无人坐在自己的原位上。总数 = 4! = 24。设 Aᵢ 为第 i 个人保持原位的事件，计算 |A₁ ∪ A₂ ∪ A₃ ∪ A₄| 并从 24 中减去，得到错排数：9。
Dₙ = n! [1 − 1/1! + 1/2! − 1/3! + … + (-1)ⁿ/n!]
错排数公式 Dₙ = n! [1 − 1/1! + 1/2! − 1/3! + … + (−1)ⁿ/n!]
9. Derangements: When Nothing Stays in Its Place | 错排：无一保持原位
A derangement is an arrangement where no object occupies its original position—the ultimate 'changing places' scenario. The number of derangements of n items, denoted !n or Dₙ, grows roughly like n!/e. For small n, we can compute manually or use recursion.
错排是这样一种排列：没有任何物体占据它原本的位置——这是最彻底的“换位”情境。n 个物品的错排数，记作 !n 或 Dₙ，其数量近似于 n!/e。对于较小的 n，我们可以手动计算或使用递推关系。
ation. In Edexcel style questions, you may be asked for D₄ or D₅ without naming the concept, simply by applying the inclusion-exclusion results from the previous section.
递推关系 Dₙ = (n – 1)(Dₙ₋₁ + Dₙ₋₂)，其中 D₁ = 0，D₂ = 1，可以快速计算。在爱德思风格的题目中，你可能会被要求求 D₄ 或 D₅，而无需指明这一概念的名称，只需应用上一节的容斥结果即可。
| n | Dₙ |
|---|---|
| 3 | 2 |
| 4 | 9 |
| 5 | 44 |
10. Summary and Exam Tips | 总结与考试技巧
When approaching 'changing places' problems in an Edexcel A-Level Maths exam, start by identifying whether objects are distinct, whether positions are distinct, and what constraints apply. Draw diagrams for circular arrangements, label fixed positions, and systematically separate the counting stages.
在爱德思 A-Level 数学考试中解答“换位”问题时，首先要判断物体是否互异、位置是否不同、以及适用哪些约束。对于圆排列要画图，标注固定位置，并系统地将计数分成阶段。
Key formulae to remember: n! for linear permutations, n!/(n − r)! for permutations of r from n, (n − 1)! for circles, and the tactic of treating together-objects as blocks. Always ask yourself: 'Who is allowed to change places, and under what rules?' before multiplying possibilities.
需要记住的关键公式有：线性排列的 n!，从 n 个中选 r 个排列的 n!/(n – r)!，圆排列的 (n – 1)!，以及将必须在一起的物体视为块的策略。在将各种可能相乘之前，永远要先问自己：“谁被允许换位，依据什么规则？”
Practice with past paper questions that combine fixed points, blocks, circular tables and inclusion-exclusion. The concept of changing places runs through all these topics, and a clear structured approach will turn seemingly complex restrictions into manageable step-by-step counts.
通过历年真题练习那些融合了不动点、块、圆桌和容斥原理的题目。换位的概念贯穿所有这些专题，而清晰的结构化方法可以将看似复杂的限制转化为可逐步处理的计数。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图