📚 Multiplication and Arrays: From Grade 2 Foundations to IGCSE Skills | 乘法与阵列：从二年级基础到 IGCSE 技能
In Cambridge IGCSE Mathematics, multiplication is a core skill that connects number, algebra, geometry and statistics. Many learners first meet multiplication through arrays in primary school, where objects are arranged in neat rows and columns. This article revisits that primary foundation and shows how array thinking supports factors, multiples, prime factorisation, algebraic expansion and area problems at IGCSE level, so that a Grade 2 picture becomes a genuine problem-solving tool.
在剑桥 IGCSE 数学中，乘法是连接数字、代数、几何和统计的核心技能。许多学生第一次接触乘法是在小学，通过把物体排列成整齐的行与列，也就是阵列模型。本文回顾这一小学基础，并展示阵列思维如何在 IGCSE 阶段支持因数、倍数、质因数分解、代数展开和面积问题，让二年级的一张图真正变成解决问题的工具。
1. What Is an Array? | 什么是阵列？
s. The array model makes multiplication concrete and explains why multiplication works: counting one row gives the size of each equal group, and counting the rows gives how many groups there are.
阵列是把物体按行和列排列成长方形的形式。例如一个 3 × 4 的阵列有 3 行和 4 列，物体总数为 3 × 4 = 12。阵列模型让乘法变得具体，也解释了乘法为什么成立：数一行得到每组有多少个，数行数得到一共有多少个相等的组。
3 × 4 = 4 + 4 + 4 = 12
The two readings of the same array — "3 rows of 4" and "4 rows of 3" — are exactly the two ways primary teachers describe a multiplication fact. Keeping this picture in mind matters at IGCSE because every rectangle diagram, every area formula and every grid method of multiplication is the same array seen from a different angle.
同一个阵列有两种读法——"3 行，每行 4 个"和"4 行，每行 3 个"——这正是小学老师描述乘法事实的两种方式。把这张图记在脑子里对 IGCSE 很重要，因为每一张长方形示意图、每一个面积公式、每一种网格乘法，其实都是同一个阵列换个角度看而已。
2. Multiplication as Repeated Addition | 乘法作为重复加法
0. Each row of an array is one group, so the array picture and the repeated-addition sentence describe exactly the same situation.
重复加法是通往乘法最简单的桥梁。5 × 6 表示五组 6，也就是 6 + 6 + 6 + 6 + 6 + 6 = 30。阵列的每一行就是一组，所以阵列图和重复加法算式描述的是完全相同的情景。
5 × 6 = 6 + 6 + 6 + 6 + 6 + 6 = 30
In IGCSE, this idea reappears in sequences and patterns, where a term may be found by multiplying a position number by a constant. For example, the sequence 3, 6, 9, 12, ... has nth term 3n, which is the same as "n rows of 3".
在 IGCSE 中，这个想法会以数列与规律的形式再次出现：某一项可以由位置编号乘以一个常数得到。例如数列 3, 6, 9, 12, … 的第 n 项是 3n，这正相当于"n 行，每行 3 个"。
3. Commutativity and Rotating the Array | 交换律与阵列旋转
re proof of commutativity: 3 × 4 = 4 × 3 = 12. The product does not change when the order of the factors changes.
把阵列旋转 90°，行就变成列，列就变成行，3 × 4 的阵列变成 4 × 3 的阵列，物体总数仍然是 12。这就给乘法交换律提供了一个图形证明：3 × 4 = 4 × 3 = 12。因数顺序改变，积不变。
3 × 4 = 4 × 3 = 12
Be careful: commutativity holds for multiplication and addition, but not for subtraction or division. 4 − 3 does not equal 3 − 4, and 12 ÷ 4 does not equal 4 ÷ 12. Recognising which operations allow reordering is a small point that prevents many careless IGCSE errors.
要注意：交换律对乘法和加法成立，但对减法和除法不成立。4 − 3 不等于 3 − 4，12 ÷ 4 也不等于 4 ÷ 12。认清哪些运算可以调换顺序，是一个小细节，却能避免 IGCSE 中许多粗心错误。
4. Factors and Factor Pairs | 因数与因数对
of different rectangles (counting rotations as the same) equals the number of factor pairs. A factor is simply a row length that fits exactly, with nothing left over.
每一个由 12 个物体组成的长方形阵列都对应 12 的一个因数对：1 × 12、2 × 6、3 × 4。所以不同长方形（旋转视为同一个）的个数等于因数对的个数。因数就是"能正好排满、一点也不剩"的每行长度。
| Array 阵列 | Factor pair 因数对 | Product 积 |
|---|---|---|
| 1 × 12 | 1, 12 | 12 |
| 2 × 6 | 2, 6 | 12 |
| 3 × 4 | 3, 4 | 12 |
, 3, 4, 5, 6; since 6 × 6 = 36 we can stop at 6. The same pairing idea underpins highest common factor (HCF) and lowest common multiple (LCM) questions.
这就是因数成对出现的原因，也是我们在列举因数时只需试到平方根的原因。要找 36 的因数，只需检验 1、2、3、4、5、6，因为 6 × 6 = 36，到了 6 就可以停下。同样的配对思想也支撑着最大公因数（HCF）和最小公倍数（LCM）的题目。
5. Square Numbers and Prime Numbers | 完全平方数与质数
numbers can be arranged as a single square array with nothing left over, and that is exactly why √16 = 4. The array gives a visual meaning to the square root.
正方形阵列的行数与列数相等，例如 4 × 4 = 16。只有完全平方数才能排成一个不留空隙的正方形阵列，这正是 √16 = 4 的图形含义。阵列给平方根一个看得见的意义。
4 × 4 = 16 ⇔ √16 = 4
. It cannot be arranged as a rectangle with more than one row and more than one column. This gives a visual definition of a prime number and explains why 1 is not prime and why 2 is the only even prime.
像 7 这样的质数只有一种非平凡阵列：1 × 7 的一条直线。它无法排成行数和列数都大于 1 的长方形。这给质数提供了一个直观定义，也解释了为什么 1 不是质数，以及为什么 2 是唯一的偶质数。
6. Prime Factorisation and Arrays | 质因数分解与阵列
Factor trees and factor ladders (short division) are the two standard methods, and both are really "unbuilding" an array until only prime row lengths remain.
质因数分解把一个数拆成质因数的乘积。例如 60 = 2 × 2 × 3 × 5，通常用指数记法写成 2² × 3 × 5。因数树和因数阶梯（短除法）是两种标准方法，它们本质上都是把阵列不断拆开，直到每行长度都只剩质数为止。
60 = 2 × 2 × 3 × 5 = 2² × 3 × 5
20, 4 × 15, 5 × 12 and 6 × 10, which is six pairs and twelve factors in total, matching the formula.
由 2² × 3 × 5 可以不必逐一列举就算出因数个数：(2 + 1)(1 + 1)(1 + 1) = 12 个。60 的因数对为 1 × 60、2 × 30、3 × 20、4 × 15、5 × 12、6 × 10，共六对、十二个因数，与公式完全吻合。
7. Arrays and Algebraic Expansion | 阵列与代数展开
An area model is simply an algebraic array. The product (x + 3)(x + 2) can be drawn as a rectangle of width x + 3 and height x + 2, split into four smaller regions: x², 2x, 3x and 6. Adding them gives x² + 5x + 6.
面积模型其实就是代数版的阵列。乘积 (x + 3)(x + 2) 可以画成一个宽为 x + 3、高为 x + 2 的长方形，被分成四块小区域：x²、2x、3x 和 6。把它们相加就得到 x² + 5x + 6。
(x + 3)(x + 2) = x² + 2x + 3x + 6 = x² + 5x + 6
a rule. It also makes negative terms easier to handle: (x + 3)(x − 2) = x² − 2x + 3x − 6 = x² + x − 6, because one region of the rectangle is negative in area.
这与 FOIL 法则（首项、外项、内项、末项）完全一致，但阵列解释了中间两项为什么会出现，而不是让你死记一条规则。它也让负项更容易处理：(x + 3)(x − 2) = x² − 2x + 3x − 6 = x² + x − 6，因为长方形中有一块区域的面积是负的。
8. Area Problems with Algebraic Sides | 代数边长的面积问题
Rectangle area equals length times width, which is the array in geometrical clothing. At IGCSE this formula is applied to compound shapes and to shapes whose sides are expressions rather than numbers.
长方形面积等于长乘以宽，这就是穿上几何外衣的阵列。在 IGCSE 中，这个公式被用于复合图形，以及边长是代数式而非数字的图形。
Area = length × width
ide lengths are positive, so x must be greater than 2 here; an algebraic answer that makes a side negative is invalid in a geometry question.
一个宽 (x − 2) cm、长 (x + 5) cm 的长方形，面积为 (x − 2)(x + 5) = x² + 3x − 10 cm²。一定要带上单位：cm ×
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图