# Jia Xian

### Born: about 1010 in China

Died: about 1070 in China

**Jia Xian**is also known as

**Chia Hsien.**Almost nothing is known about his life. It is recorded that he was a pupil of Chu Yan who was a famous calendarist, astronomer and mathematician. We know that Chu Yan was productive over the years 1022 to 1054 so he must have tutored Jia Xian at some time between these years. Other evidence would suggest that Chu Yan taught Jia Xian fairly near the beginning of his career.

According to Qian [3], Jia Xian was a Palace Eunuch of the Left Duty Group. This requires a little explanation. The Emperor of China would employ eunuchs, castrated men, as guards and servants in his Palace. Although the original role was that of guarding the women's quarters, these men achieved real power and influence. In addition to their role as guards they became confidential advisers to the Emperor, and sometimes government ministers.

Jia Xian is known to have written two mathematics books: *Huangdi Jiuzhang Suanjing Xicao* (The Yellow Emperor's detailed solutions to the Nine Chapters on the Mathematical Art), and *Suanfa Xuegu Ji* (A collection of ancient mathematical rules). Both are lost and we know nothing of the second of the two books other than its title. The first, however, although it has been lost is known to us in some detail. This is because Yang Hui wrote *Xiangjie Jiuzhang Suanfa* (A detailed analysis of the mathematical rules in the Nine Chapters) in 1261 with the intention of explaining, and making better known, the work of Jia Xian. A copy of Yang Hui's text has survived and he explicitly states his reasons for writing the work in the preface.

What does Yang Hui tell us of Jia Xian's mathematical contribution? The first is an understanding of Pascal's triangle. Here Jia Xian is aware of the expansion of (*a* + *b*)^{n} and gives a table of the resulting binomial coefficients in the form of Pascal's triangle. Jia Xian appears to have calculated the binomial coefficients up to *n* = 6 and gave an accompanying table similar to Pascal's triangle which records the coefficients up to the row

The other contribution is an algorithm for root extraction but, as we shall see below, it uses the Pascal triangle method. He generalised a method of finding square roots and cube roots to finding nth roots, for n > 3, and then extended the method to solving polynomial equations of arbitrary degree. The algorithm is called the *Zeng chang kaifang* method by Jia Xian, which means the additive-multiplicative method for root extractions. The method is essentially that which today is called the Ruffini-Horner method or Horner's method.

Let us illustrate the method by solving

*x*

^{3}= 146363183

^{6}<

*x*

^{3}< 10

^{9}we see that 100 <

*x*< 1000. Put

*x*= 100

*a*+ 10

*b*+

*c*where

*a*is between 1 and 9 and

*b*,

*c*are between 0 and 9. Since 500

^{3}= 125000000 and 600

^{3}= 216000000 we see that

*a*= 5. Now consider

*b*)

^{3}= 125000000 + 7500000

*b*+ 150000

*b*

^{2}+ 1000

*b*

^{3}≤ 146363183.

*b*+ 150000

*b*

^{2}+ 1000

*b*

^{3}≤ 21363183

*b*< 3 and

*b*= 2 is easily seen to be the largest possible value giving the left hand side 15608000. Now with

*a*= 5 and

*b*= 2,

*x*= 100

*a*+ 10

*b*+

*c*has become 520 +

*c*so

*x*

^{3}= (520 +

*c*)

^{3}. Subtract 15608000 from 21363183 to get

*c*+ 1560

*c*

^{2}+

*c*

^{3}= 5755183

*c*= 7.

A fascinating historical account of methods of root extraction used by Chinese and Arabic scholars is given in [4]. Chemla defines precisely what constitutes the Ruffini-Horner method so that at each step of the algorithm precisely the same procedure, using multiplication and subtraction, is carried out until the root is obtained. After examining earlier Chinese methods given in the Nine Chapters on the Mathematical Art and those by Zhang Qiujian in the fifth century, she concludes that Jia Xian was the first to use the Ruffini-Horner method. An examination of root extraction methods by Arabic authors leads to the conclusion that al-Samawal in the twelfth century was the first to use the Ruffini-Horner method. It is also shown in [4] that both Jia Xian's method and al-Samawal's method end up with the same form for the approximation of nth roots. If *a* is the integral portion of the *n*th root of *A*, then the approximation is given by

*a*+ (

*A*-

*a*

^{n})/[(

*a*+ 1)

^{n}-

*a*

^{n}].

**Article by:** *J J O'Connor* and *E F Robertson*

**December 2003**

**MacTutor History of Mathematics**

[http://www-history.mcs.st-andrews.ac.uk/Biographies/Jia_Xian.html]