Chinese Mathematics
Rod calculus, systematic problem solving, and independent discoveries that anticipated Western mathematics by centuries
Timeline of Chinese Mathematics
c. 1600 BCE β Oracle bone inscriptions (Shang dynasty) with early decimal numerals
c. 500 BCE β Earliest counting rod calculations
c. 300 BCE β Compilation of early sources that would become the Nine Chapters
c. 200 BCEβ200 CE β Jiuzhang Suanshu (Nine Chapters on the Mathematical Art) takes its final form
c. 100 CE β Gaussian elimination method in Chapter 8 of the Nine Chapters
c. 250 CE β Sun Zi's Sunzi Suanjing β Chinese Remainder Theorem
263 CE β Liu Hui's commentary on the Nine Chapters; method of exhaustion for pi
429β500 CE β Zu Chongzhi computes pi to 7 decimal places; discovers 355/113
c. 1050 CE β Jia Xian discovers "Pascal's triangle" and the binomial theorem
1261 CE β Yang Hui publishes the triangle and combinatorial formulas
1247 CE β Qin Jiushao's Mathematical Treatise in Nine Sections β generalized CRT
1303 CE β Zhu Shijie's Precious Mirror of the Four Elements β polynomial algebra
3.1 The Nine Chapters on the Mathematical Art
The Jiuzhang Suanshu (Nine Chapters on the Mathematical Art) is the most important and influential mathematical text in the history of Chinese mathematics. Compiled from earlier sources over the period c. 200 BCE to 200 CE, it stands alongside Euclid's Elements as one of the two great mathematical classics of the ancient world β though their approaches could hardly be more different. Where Euclid proceeds axiomatically from definitions and postulates to theorems, the Nine Chaptersproceeds algorithmically from problems to solutions.
The text contains 246 problems organized into nine chapters, each devoted to a specific area of practical mathematics. The problems are presented in a consistent format: a statement of the problem, the answer, and then the method (algorithm) for arriving at the answer. Here is a summary of the nine chapters:
| Chapter | Title | Content | Problems |
|---|---|---|---|
| 1 | Fangtian (Field Measurement) | Areas of fields: rectangles, triangles, trapezoids, circles, sectors | 38 |
| 2 | Sumi (Millet and Rice) | Proportions, exchange rates, percentage calculations | 46 |
| 3 | Cuifen (Distribution by Proportion) | Proportional distribution, partnership problems | 20 |
| 4 | Shaoguang (Short Width) | Square roots, cube roots, finding dimensions from known areas/volumes | 24 |
| 5 | Shanggong (Construction Consultations) | Volumes of solids: prisms, pyramids, cones, frustums, spheres | 28 |
| 6 | Junshu (Fair Taxation) | Ratio and proportion applied to taxation, transport of grain | 28 |
| 7 | Yingbuzu (Excess and Deficit) | Method of double false position (rule of double false position) | 20 |
| 8 | Fangcheng (Rectangular Arrays) | Systems of linear equations solved by matrix methods | 18 |
| 9 | Gougu (Right Triangles) | Pythagorean theorem, quadratic equations from geometric problems | 24 |
Several features of the Nine Chapters are remarkable:
- Negative numbers: Chapter 8 introduces red and black counting rods to represent positive and negative numbers β the earliest systematic use of negative numbers in any mathematical tradition. Rules for adding and subtracting signed numbers are given explicitly.
- Fractions: The text works fluently with fractions, including addition, subtraction, multiplication, and division, as well as reduction to lowest terms using what we would call the Euclidean algorithm for GCD.
- The Pythagorean theorem: Chapter 9 (Gougu) applies the right-triangle relationship extensively, calling the two shorter sides gou (hook) and gu (leg), and the hypotenuse xian (bowstring).
- Square and cube roots: Chapter 4 gives algorithms for extracting square and cube roots that are essentially the same as the methods used before calculators β digit-by-digit extraction.
In 263 CE, Liu Hui wrote a brilliant commentary on the Nine Chapters, providing mathematical justifications (proofs) for the algorithms, correcting errors, and adding his own results. Liu Hui's commentary transformed the Nine Chapters from a practical handbook into a work of genuine mathematical depth.
Video: The Genius of Ancient Chinese Mathematics
An overview of the Nine Chapters on the Mathematical Art and the extraordinary range of mathematical problems it solved β from simultaneous equations to volumes of solids.
Video: Ancient China Invented Matrix Math?
How the Fangcheng method in the Nine Chapters used rectangular arrays of numbers β effectively Gaussian elimination β to solve systems of linear equations 2,000 years before Gauss.
3.2 Rod Numerals and Counting Board Arithmetic
The computational engine of Chinese mathematics was the counting board (suanpan or chouma), a flat surface on which bamboo or ivory rods were arranged to represent numbers and perform calculations. Unlike the abacus (which was a later development in China, appearing around the 2nd century CE and becoming dominant by the 14th century), the counting board allowed much more sophisticated manipulations, including the representation of polynomials and matrices.
Definition: Rod Numeral Representation
Counting rods represented digits 1 through 9 using two alternating orientations:
- Vertical rods (used for units, hundreds, ten-thousands, ...): 1β5 represented by 1β5 vertical rods; 6β9 by one horizontal rod plus 1β4 vertical rods
- Horizontal rods (used for tens, thousands, hundred-thousands, ...): same patterns but rotated 90 degrees
The alternating orientation eliminated the ambiguity that plagued the Babylonian system β you could always tell where one digit ended and the next began. An empty position was represented by a blank space on the counting board, and later by a circle (the zero symbol).
The rod numeral system was fully positional and decimal. Each column on the counting board represented a power of 10, and the alternating vertical/horizontal convention provided a visual separator between adjacent digits. For example, the number 60,390 would be laid out as:
Ten-thousands | Thousands | Hundreds | Tens | Units
6 (horizontal) | 0 (blank) | 3 (vertical) | 9 (horizontal) | 0 (blank)
Red rods represented positive numbers and black rods represented negative numbers β a convention introduced in Chapter 8 of the Nine Chapters. This is the earliest known systematic use of negative numbers in any civilization, predating Indian and European recognition of negative numbers by centuries.
The counting board enabled all four arithmetic operations with remarkable efficiency. Addition and subtraction were performed by physically adding or removing rods. Multiplication used a process similar to our long multiplication. Division was performed by a "galley" method that is essentially identical to modern long division. The rod calculus also enabled the extraction of square roots and cube roots through digit-by-digit algorithms that are equivalent to the modern methods.
The physical nature of the counting board had important mathematical consequences. Unlike written algorithms (which preserve intermediate steps), the counting board was constantly overwritten during computation β each step erased the previous configuration. This meant that Chinese mathematicians developed a deeply procedural approach to mathematics: the emphasis was on the algorithm (the sequence of operations) rather than on the static representation of intermediate results.
3.3 Gaussian Elimination β The Fangcheng Method
Chapter 8 of the Nine Chapters, titled Fangcheng ("rectangular arrays"), contains what is perhaps the most remarkable mathematical anticipation in the ancient world: a complete method for solving systems of simultaneous linear equations using matrix operations β essentially identical to what is now called Gaussian elimination. This method was developed in China approximately 2,000 years before Carl Friedrich Gauss (1777β1855) rediscovered it in Europe.
The method works by arranging the coefficients of a system of equations in a rectangular array (matrix) on the counting board, and then performing row operations to reduce the system to triangular form, from which the solution can be read off by back-substitution.
Example: Problem 1 of Chapter 8 β Three Types of Grain
The first problem of Chapter 8 states (paraphrased): "Three bundles of top-grade grain, two bundles of medium-grade grain, and one bundle of low-grade grain yield 39 dou. Two bundles of top-grade, three of medium, and one of low yield 34 dou. One bundle of top-grade, two of medium, and three of low yield 26 dou. Find the yield per bundle of each grade."
In modern notation, let $x, y, z$ be the yields per bundle. The system is:
$$\begin{cases} 3x + 2y + z = 39 \\ 2x + 3y + z = 34 \\ x + 2y + 3z = 26 \end{cases}$$
The coefficients are arranged in a matrix (written right to left in the Chinese convention, but here left to right for clarity):
$$\left(\begin{array}{ccc|c} 3 & 2 & 1 & 39 \\ 2 & 3 & 1 & 34 \\ 1 & 2 & 3 & 26 \end{array}\right)$$
The Fangcheng procedure then eliminates variables systematically:
The Fangcheng Elimination Procedure
Step 1: Eliminate the first variable from rows 2 and 3.
Multiply Row 2 by 3 (the leading coefficient of Row 1) and subtract 2 times Row 1:
$$3 \times (2, 3, 1, 34) - 2 \times (3, 2, 1, 39) = (0, 5, 1, 24)$$
Multiply Row 3 by 3 and subtract 1 times Row 1:
$$3 \times (1, 2, 3, 26) - 1 \times (3, 2, 1, 39) = (0, 4, 8, 39)$$
The matrix is now:
$$\left(\begin{array}{ccc|c} 3 & 2 & 1 & 39 \\ 0 & 5 & 1 & 24 \\ 0 & 4 & 8 & 39 \end{array}\right)$$
Step 2: Eliminate the second variable from Row 3.
Multiply Row 3 by 5 and subtract 4 times Row 2:
$$5 \times (0, 4, 8, 39) - 4 \times (0, 5, 1, 24) = (0, 0, 36, 99)$$
The matrix is now in upper triangular form:
$$\left(\begin{array}{ccc|c} 3 & 2 & 1 & 39 \\ 0 & 5 & 1 & 24 \\ 0 & 0 & 36 & 99 \end{array}\right)$$
Step 3: Back-substitution.
From Row 3: $36z = 99$, so $z = \frac{99}{36} = \frac{11}{4} = 2\frac{3}{4}$
From Row 2: $5y + z = 24$, so $5y = 24 - \frac{11}{4} = \frac{85}{4}$, giving $y = \frac{17}{4} = 4\frac{1}{4}$
From Row 1: $3x + 2y + z = 39$, so $3x = 39 - 2 \cdot \frac{17}{4} - \frac{11}{4} = 39 - \frac{45}{4} = \frac{111}{4}$, giving $x = \frac{37}{4} = 9\frac{1}{4}$
The solution is $x = 9\frac{1}{4}$, $y = 4\frac{1}{4}$, $z = 2\frac{3}{4}$ dou per bundle. We can verify:
$$3(9.25) + 2(4.25) + 1(2.75) = 27.75 + 8.5 + 2.75 = 39 \;\;\checkmark$$
Chapter 8 contains 18 problems of this type, involving systems of up to 5 equations in 5 unknowns. The method handles both well-determined and underdetermined systems (the latter yielding families of solutions). It also handles systems with negative coefficients, using the red/black rod convention for signs.
The rules for operating with positive and negative numbers are stated explicitly in theNine Chapters:
Rules for Signed Numbers (Nine Chapters, Chapter 8)
For subtraction (used in elimination):
- Same signs: subtract the absolute values, keep the sign of the larger
- Different signs: add the absolute values, keep the sign of the minuend
- Positive minus zero gives positive; negative minus zero gives negative
- Zero minus positive gives negative; zero minus negative gives positive
These rules are equivalent to our modern rules for signed arithmetic: the Chinese mathematicians of the 1st century CE had a complete and correct algebra of signed numbers.
3.4 The Chinese Remainder Theorem
The Chinese Remainder Theorem (CRT) is one of the fundamental results of number theory, with applications ranging from ancient calendar computation to modern cryptography (it is a key component of the RSA algorithm). Its earliest known statement appears in the Sunzi Suanjing (Sun Zi's Mathematical Manual, c. 3rdβ5th century CE).
Sun Zi's Original Problem
"There are certain things whose number is unknown. If we count them by threes, we have two left over; by fives, we have three left over; by sevens, we have two left over. How many things are there?"
In modern notation, find $x$ such that:
$$x \equiv 2 \pmod{3}, \qquad x \equiv 3 \pmod{5}, \qquad x \equiv 2 \pmod{7}$$
The Chinese Remainder Theorem (General Statement)
Let $m_1, m_2, \ldots, m_k$ be pairwise coprime positive integers (i.e., $\gcd(m_i, m_j) = 1$ for $i \neq j$). Then the system of congruences:
$$x \equiv a_1 \pmod{m_1}, \quad x \equiv a_2 \pmod{m_2}, \quad \ldots, \quad x \equiv a_k \pmod{m_k}$$
has a unique solution modulo $M = m_1 m_2 \cdots m_k$. The solution is:
$$x \equiv \sum_{i=1}^{k} a_i M_i y_i \pmod{M}$$
where $M_i = M / m_i$ and $y_i$ is the multiplicative inverse of $M_i$ modulo $m_i$ (i.e., $M_i y_i \equiv 1 \pmod{m_i}$).
Example: Solving Sun Zi's Problem Step by Step
We have $m_1 = 3, m_2 = 5, m_3 = 7$ and $a_1 = 2, a_2 = 3, a_3 = 2$.
Step 1: Compute $M = 3 \times 5 \times 7 = 105$
Step 2: Compute the partial products:
$$M_1 = \frac{105}{3} = 35, \qquad M_2 = \frac{105}{5} = 21, \qquad M_3 = \frac{105}{7} = 15$$
Step 3: Find the multiplicative inverses:
- $35 y_1 \equiv 1 \pmod{3}$: Since $35 = 11 \times 3 + 2$, we need $2 y_1 \equiv 1 \pmod{3}$, so $y_1 = 2$ (since $2 \times 2 = 4 \equiv 1 \pmod{3}$)
- $21 y_2 \equiv 1 \pmod{5}$: Since $21 = 4 \times 5 + 1$, we have $1 \cdot y_2 \equiv 1 \pmod{5}$, so $y_2 = 1$
- $15 y_3 \equiv 1 \pmod{7}$: Since $15 = 2 \times 7 + 1$, we have $1 \cdot y_3 \equiv 1 \pmod{7}$, so $y_3 = 1$
Step 4: Compute the solution:
$$x \equiv a_1 M_1 y_1 + a_2 M_2 y_2 + a_3 M_3 y_3 \pmod{105}$$
$$x \equiv 2 \times 35 \times 2 + 3 \times 21 \times 1 + 2 \times 15 \times 1 \pmod{105}$$
$$x \equiv 140 + 63 + 30 \pmod{105} = 233 \pmod{105}$$
$$x \equiv 233 - 2 \times 105 = 23 \pmod{105}$$
Verification:
- $23 = 7 \times 3 + 2$, so $23 \equiv 2 \pmod{3}$ $\checkmark$
- $23 = 4 \times 5 + 3$, so $23 \equiv 3 \pmod{5}$ $\checkmark$
- $23 = 3 \times 7 + 2$, so $23 \equiv 2 \pmod{7}$ $\checkmark$
The smallest positive solution is $x = 23$. The general solution is $x = 23 + 105k$ for any non-negative integer $k$: that is, 23, 128, 233, 338, ...
Sun Zi's method was more heuristic than the general algorithm above. He gave the rule as a verse (paraphrased): "If the remainder on dividing by 3 is $a_1$, multiply by 70. If the remainder on dividing by 5 is $a_2$, multiply by 21. If the remainder on dividing by 7 is $a_3$, multiply by 15. Add these and subtract 105 as many times as needed." That is:
$$x \equiv 70a_1 + 21a_2 + 15a_3 \pmod{105}$$
Note that $70 = 2 \times 35 = M_1 y_1 \cdot a_1/a_1$ (the magic multiplier for the mod-3 condition), and similarly $21 = M_2 y_2$ and $15 = M_3 y_3$.
The CRT was later generalized by Qin Jiushao (1202β1261) in his Shushu Jiuzhang (Mathematical Treatise in Nine Sections, 1247), where he gave a systematic method (the "Great Extension" or Dayan method) for solving CRT problems with moduli that are not necessarily pairwise coprime. Qin Jiushao's algorithm includes a method equivalent to the extended Euclidean algorithm for finding multiplicative inverses. This was the most sophisticated number-theoretic algorithm anywhere in the world until Euler's work in the 18th century.
Video: Chinese Remainder Theorem β Numberphile
Numberphile's visual demonstration of the Chinese Remainder Theorem β the ancient result from the Sun Zi Suanjing that underpins modern cryptography and computer arithmetic.
3.5 Liu Hui's Algorithm for Pi (263 CE)
Liu Hui (c. 225β295 CE) is one of the greatest mathematicians of the ancient world. His commentary on the Nine Chapters (263 CE) transformed Chinese mathematics by providing rigorous justifications for the algorithms in the text and by developing new methods of his own. His most celebrated achievement is his algorithm for computing $\pi$ using inscribed regular polygons β a method known in the West as the method of exhaustion, attributed to Archimedes (c. 250 BCE) but developed independently by Liu Hui.
Liu Hui's Method of Exhaustion for Pi
Liu Hui's key insight: the area of a circle can be approximated by the area of an inscribed regular polygon. As the number of sides increases, the polygon approximates the circle more closely. Starting with an inscribed regular hexagon (6 sides) and repeatedly doubling the number of sides:
$$6 \to 12 \to 24 \to 48 \to 96 \to 192 \to \cdots$$
the polygon areas converge to the circle area, yielding increasingly precise values of $\pi$.
The critical formula for doubling the number of polygon sides involves computing the side length of a $2n$-gon from the side length of an $n$-gon. If $s_n$ is the side length of a regular $n$-gon inscribed in a circle of radius $r$, then:
Side-Doubling Formula
The side length of the $2n$-gon is related to that of the $n$-gon by:
$$s_{2n} = \sqrt{2r^2 - r\sqrt{4r^2 - s_n^2}}$$
This can be derived from the geometry of the inscribed polygon. If $d_n$ denotes the "sagitta" (the distance from the midpoint of a side to the arc), then:
$$d_n = r - \sqrt{r^2 - \left(\frac{s_n}{2}\right)^2}$$
and the new side length is:
$$s_{2n} = \sqrt{\left(\frac{s_n}{2}\right)^2 + d_n^2}$$
Example: Liu Hui's Computation β From Hexagon to 96-gon
For a circle of radius $r = 1$, the inscribed regular hexagon has side length $s_6 = 1$ (since each side subtends a 60-degree angle in a unit circle).
The area of the regular $n$-gon inscribed in a circle of radius $r$ is:
$$A_n = \frac{n}{2} \cdot s_n \cdot \sqrt{r^2 - \frac{s_n^2}{4}}$$
Since $\pi r^2 = \pi$ for $r = 1$, we have $\pi \approx A_n$. Liu Hui computed:
β’ $n = 6$: $A_6 = \frac{3\sqrt{3}}{2} \approx 2.598076$ (i.e., $\pi \approx 2.598$)
β’ $n = 12$: $A_{12} = 3 \approx 3.000000$
β’ $n = 24$: $A_{24} \approx 3.105829$
β’ $n = 48$: $A_{48} \approx 3.132629$
β’ $n = 96$: $A_{96} \approx 3.141032$
β’ $n = 192$: $A_{192} \approx 3.141452$
Liu Hui carried his calculation to $n = 3072$ (a 3072-sided polygon) and obtained $\pi \approx 3.14159$, accurate to 5 decimal places.
Liu Hui also developed an ingenious acceleration technique. He noticed that the errors in successive polygon approximations decrease by approximately a factor of 4 with each doubling. If $A_n$ and $A_{2n}$ are the areas of the $n$-gon and $2n$-gon, then:
$$\pi \approx A_{2n} + \frac{A_{2n} - A_n}{3}$$
This is a form of Richardson extrapolation (developed in the West in 1911), and it allowed Liu Hui to extract additional digits of accuracy from the same computational effort. Applied to the 96-gon and 192-gon approximations, this gives $\pi \approx 3.141592$ β six correct digits from polygons that individually give only four or five.
Liu Hui expressed his final result as: $\pi \approx 3.1416$, and he also gave the simplified approximation $\pi \approx \frac{157}{50} = 3.14$ for everyday calculations.
Video: Liu Hui's Method to Estimate Pi β Explained
A step-by-step walkthrough of Liu Hui's polygon-doubling algorithm for approximating Ο β the same method he used to compute 3.14159 in 263 CE.
Video: The Mathematician of Ancient China β Liu Hui
A biographical documentary on Liu Hui β his commentary on the Nine Chapters, his proof of the area formula for circles, and his calculation of Ο using a 3,072-sided polygon.
3.6 Zu Chongzhi (429β500 CE)
Zu Chongzhi was one of the greatest mathematicians and astronomers of ancient China. Building on Liu Hui's method, he pushed the computation of $\pi$ to an extraordinary seven decimal places:
$$3.1415926 < \pi < 3.1415927$$
This accuracy was not surpassed anywhere in the world for nearly a thousand years β until al-Kashi in Samarkand computed $\pi$ to 16 decimal places in 1424.
Zu Chongzhi must have used polygons with at least 12,288 ($= 3 \times 2^{12}$) or perhaps 24,576 sides, requiring hundreds of steps of the side-doubling formula β each step involving square root extractions to many digits. The sheer computational labor, performed entirely with counting rods on a counting board, is staggering.
Zu Chongzhi's Rational Approximations of Pi
Zu Chongzhi gave two rational approximations:
Rough fraction (yuelv):
$$\pi \approx \frac{22}{7} \approx 3.142857\ldots$$
Precise fraction (milv):
$$\pi \approx \frac{355}{113} \approx 3.14159292\ldots$$
The precise fraction $\frac{355}{113}$ is accurate to 6 decimal places (error $< 3 \times 10^{-7}$) and is the best rational approximation of $\pi$ with denominator less than 16,604. It is a convergent of the continued fraction expansion of $\pi$:
$$\pi = 3 + \cfrac{1}{7 + \cfrac{1}{15 + \cfrac{1}{1 + \cfrac{1}{292 + \cdots}}}}$$
The convergents are $3, \frac{22}{7}, \frac{333}{106}, \frac{355}{113}, \frac{103993}{33102}, \ldots$ The unusually large partial quotient 292 means that $\frac{355}{113}$ is an exceptionally good approximation for its size β the next convergent $\frac{103993}{33102}$ requires a denominator nearly 300 times larger for only modest improvement.
In Europe, this fraction was not discovered until Adriaan Metius published it in 1585 (and it is sometimes called "Metius's fraction"), more than a thousand years after Zu Chongzhi.
Cavalieri's Principle β 1,100 Years Early
Zu Chongzhi and his son Zu Geng (Zu Gengzhi) are also credited with discovering what is known in the West as Cavalieri's Principle (stated by Bonaventura Cavalieri in 1635). Their version states:
The Zu-Geng Principle (Cavalieri's Principle)
"If two solids have the same cross-sectional area at every height, they have the same volume."
In modern notation: if solids $A$ and $B$ satisfy
$$\text{Area}(A \cap \{z = h\}) = \text{Area}(B \cap \{z = h\}) \quad \text{for all } h$$
then $\text{Volume}(A) = \text{Volume}(B)$.
Zu Geng used this principle to derive the volume of a sphere. The key idea is to compare a hemisphere of radius $r$ with a cylinder of radius $r$ and height $r$ from which an inverted cone has been removed. At height $h$ above the base:
- The hemisphere has a circular cross-section of radius $\sqrt{r^2 - h^2}$, so its area is $\pi(r^2 - h^2)$.
- The cylinder-minus-cone has a circular annular cross-section with outer radius $r$ and inner radius $h$, so its area is $\pi(r^2 - h^2)$.
Since the cross-sections are equal at every height, the volumes are equal. The volume of the cylinder-minus-cone is:
$$\pi r^3 - \frac{1}{3}\pi r^3 = \frac{2}{3}\pi r^3$$
This is the volume of a hemisphere, so the volume of a full sphere is:
$$V = \frac{4}{3}\pi r^3$$
This derivation is identical in logic to the one Cavalieri and his European successors would use more than eleven centuries later. It represents a profound application of proto-integral reasoning β comparing volumes by comparing infinitely many cross-sectional slices.
3.7 The Pascal Triangle in China
The triangular array of binomial coefficients known in the West as "Pascal's Triangle" (after Blaise Pascal, who published it in 1665) was known in China centuries earlier. It was first described by Jia Xian (c. 1010β1070 CE) and later popularized by Yang Hui (c. 1238β1298 CE), after whom it is called the Yang Hui Triangle (Yang Hui Sanjiao) in Chinese mathematics.
Definition: The Binomial Coefficients and Pascal's Triangle
The binomial coefficient $\binom{n}{k}$ counts the number of ways to choose $k$ items from $n$ items:
$$\binom{n}{k} = \frac{n!}{k!(n-k)!}$$
Pascal's triangle is the triangular array where row $n$ contains the values $\binom{n}{0}, \binom{n}{1}, \ldots, \binom{n}{n}$:
1
1 Β 1
1 Β 2 Β 1
1 Β 3 Β 3 Β 1
1 Β 4 Β 6 Β 4 Β 1
1 Β 5 Β 10 Β 10 Β 5 Β 1
1 Β 6 Β 15 Β 20 Β 15 Β 6 Β 1
Each entry is the sum of the two entries above it β the fundamental recursion:
$$\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}$$
Jia Xian used the triangle in connection with his method for extracting higher-order roots. To find the $n$-th root of a number, one needs the binomial expansion:
$$(a + b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k = \binom{n}{0}a^n + \binom{n}{1}a^{n-1}b + \cdots + \binom{n}{n}b^n$$
Example: Using the Binomial Expansion for Cube Root Extraction
Suppose we want to compute $\sqrt[3]{103823}$. We guess $a = 40$(since $40^3 = 64000$) and need to find $b$ such that $(40 + b)^3 = 103823$.
Expanding using the binomial coefficients from row 3 of the triangle (1, 3, 3, 1):
$$(40 + b)^3 = 40^3 + 3(40^2)b + 3(40)b^2 + b^3$$
$$= 64000 + 4800b + 120b^2 + b^3$$
We need $64000 + 4800b + 120b^2 + b^3 = 103823$, so $4800b + 120b^2 + b^3 = 39823$. Trying $b = 7$:
$$4800(7) + 120(49) + 343 = 33600 + 5880 + 343 = 39823 \;\;\checkmark$$
So $\sqrt[3]{103823} = 47$. Jia Xian's method generalizes this to any root and any number of digits, using the triangle to generate the required binomial coefficients.
Yang Hui, in his Xiangjie Jiuzhang Suanfa (Detailed Analysis of the Nine Chapters, 1261), published a diagram of the triangle through row 6 and explicitly attributed it to Jia Xian. Yang Hui also applied the triangle to problems in combinatorics and permutations.
The triangle was independently discovered in multiple civilizations:
| Mathematician | Culture | Date | Context |
|---|---|---|---|
| Pingala | Indian | c. 200 BCE | Prosody (metrical patterns) |
| Jia Xian | Chinese | c. 1050 CE | Root extraction |
| Omar Khayyam | Persian | c. 1100 CE | Binomial theorem |
| Yang Hui | Chinese | 1261 CE | Combinatorics |
| Nasir al-Din al-Tusi | Persian | c. 1265 CE | Binomial coefficients |
| Blaise Pascal | French | 1665 CE | Probability theory |
The culmination of the Chinese algebraic tradition came with Zhu Shijie (c. 1249β1314), whose masterwork Siyuan Yujian (Precious Mirror of the Four Elements, 1303) dealt with systems of polynomial equations in up to four unknowns. Zhu Shijie published the triangle through row 8 and used it systematically in his work on polynomial algebra. He also discovered formulas for sums of series, including:
$$\sum_{k=1}^{n} k = \frac{n(n+1)}{2}, \qquad \sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6}, \qquad \sum_{k=1}^{n} k^3 = \left(\frac{n(n+1)}{2}\right)^2$$
3.8 Legacy and Comparative Perspective
Chinese mathematics developed an approach fundamentally different from the Greek deductive tradition. Where Greek mathematics prized proof from axioms, Chinese mathematics prized algorithm and computation. Where Euclid sought to demonstrate eternal truths about abstract geometric objects, the Nine Chapters sought to provide effective methods for solving practical problems. Both approaches are essential to modern mathematics, and the Chinese algorithmic tradition has proven especially relevant to the computer age.
Major Chinese Innovations and Their Western Counterparts
| Innovation | Chinese Date | Western Discoverer | Western Date | Gap |
|---|---|---|---|---|
| Negative numbers | c. 100 CE | Brahmagupta (India) | 628 CE | ~500 yr |
| Gaussian elimination | c. 100 CE | Gauss | 1810 CE | ~1700 yr |
| Chinese Remainder Theorem | c. 300 CE | Euler, Gauss | c. 1800 CE | ~1500 yr |
| Method of exhaustion for pi | 263 CE | Archimedes | c. 250 BCE | Independent |
| Cavalieri's Principle | c. 480 CE | Cavalieri | 1635 CE | ~1150 yr |
| Pascal's Triangle | c. 1050 CE | Pascal | 1665 CE | ~600 yr |
| Horner's method | c. 1050 CE | Horner | 1819 CE | ~770 yr |
| Richardson extrapolation | 263 CE | Richardson | 1911 CE | ~1650 yr |
The pattern is striking: in algorithm design and computational mathematics, Chinese mathematicians consistently anticipated Western discoveries by centuries and sometimes millennia. This is not coincidental β it reflects the algorithmic orientation of the Chinese tradition. When your primary goal is to compute answers rather than prove theorems, you naturally develop sophisticated computational methods.
Influence on East Asian Mathematics
Chinese mathematical works were transmitted throughout East Asia. The Nine Chapters was studied in Korea and Japan, where it formed the basis of mathematical education for centuries. The Japanese tradition of wasan (Japanese mathematics), which flourished in the 17thβ19th centuries, has its roots in Chinese mathematical texts and methods.
Korean mathematics similarly drew heavily on Chinese sources. The civil service examination system in both Korea and Japan included mathematics as a subject, with the Nine Chapters and its commentaries as the core curriculum β a pattern modeled on the Chinese imperial examination system, which had included mathematical testing since the Tang Dynasty (618β907 CE).
Why Chinese Mathematics Was Underappreciated
For much of the 20th century, the history of mathematics was written from a predominantly European perspective, and Chinese contributions were undervalued or ignored. Several factors contributed to this:
- Language barriers: The primary sources are in classical Chinese, which few Western historians of mathematics could read.
- Different standards of rigor: Chinese mathematics did not employ the axiomatic-deductive framework that Western historians considered the hallmark of "real" mathematics. (Liu Hui's proofs, while rigorous, were not presented in the Euclidean format.)
- Lack of continuity: Chinese mathematics experienced periods of decline (particularly during the Qing Dynasty, when the examination system de-emphasized mathematics), which obscured its earlier achievements.
- Transmission gaps: Unlike Indian mathematics, which was transmitted to Europe through the Islamic world, Chinese mathematical ideas did not have a clear transmission pathway to the West. The independent discoveries were therefore not recognized as prior.
The work of Joseph Needham (Science and Civilisation in China, 1959), Jean-Claude Martzloff (A History of Chinese Mathematics, 1987/1997), and Karine Chemla (commentary on the Nine Chapters, 2004) has done much to correct this imbalance. Today, Chinese mathematics is recognized as one of the great independent mathematical traditions of the ancient world, distinguished by its algorithmic sophistication, its early use of matrix methods and negative numbers, its pioneering work in number theory, and its remarkable computational achievements in approximating $\pi$.
The Chinese mathematical tradition demonstrates a profound truth: mathematics is not a single stream flowing from Greece to Rome to Europe to the modern world. It is a vast river with many tributaries, and the Chinese tributary β with its emphasis on algorithm, computation, and practical problem-solving β is one of the mightiest.