## Chinese Remainder Theorem History (韩信点兵)

Translation:

In Ancient China, there was a General named Han Xin, who led an army of 1500 soldiers in a battle. An estimated 400-500 soldiers died in the battle. When the soldiers stood 3 in a row, there were 2 soldiers left over. When they lined up 5 in a row, there were 4 soldiers left over. When they lined up 7 in a row, there were 6 soldiers left over. Han Xin immediately said, “There are 1049 soldiers.”

Amazing! How did Han Xin do that?

Han Xin was not only a brilliant mathematician and general, he was also a very magnanimous guy full of wisdom.

Once, when he was suffering from hunger, he met a woman who provided him with food. He promised to repay her for her kindness after he had made great achievements in life, but it was rebuffed by her. On another occasion, a hooligan saw Han Xin carrying a sword and challenged him to either kill him or crawl through between his legs. Han Xin knew that he would become a criminal if he killed him, hence instead of responding to the taunts, he crawled through between the hooligan’s legs and was laughed at.

Several years later, after becoming the King of Chu, Han Xin returned to his hometown and found the woman who fed him and rewarded her with 1,000 taels of gold. Han Xin also found the hooligan and instead of taking revenge, he appointed the hooligan as a zhongwei (中尉; equivalent to a present-day lieutenant). He said, “This man is a hero. Do you think I could not have killed him when he humiliated me? I would not become famous even if I killed him then. Hence, I endured the humiliation to preserve my life for making great achievements in future.”

Mathematical Explanation by Guest Blogger Mathtuition88:

In modern notation, the problem can be stated as

$x \equiv 2 \pmod 3$

$x\equiv 4 \pmod 5$

$x\equiv 6 \pmod 7$

We may then use the theory of the Chinese Remainder Theorem to conclude that a solution is:

$x = a(5)(7) + b(3)(7) + c(3)(5)$ , where

$35a \equiv 2 \pmod 3$

$21b \equiv 4 \pmod 5$

$15c \equiv 6 \pmod 7$

Simplifying, we get

$2a \equiv 2 \pmod 3$, which we may take a=1.

$b \equiv 4 \pmod 5$, which we may take b=4.

$c \equiv 6 \pmod 7$, which we may take c=6.

Hence, x = 1(5)(7)+4(3)(7)+6(3)(5) = 209 is a solution.

We know by the theory of Chinese Remainder Theorem that this solution is unique congruent modulo (3x5x7=105).

Hence 209 + 8 x 105 = 1049 is also a solution and indeed the most likely one since it is estimated that 400-500 soldiers died.

How exactly did the military genius Han Xin calculated it remains a mystery though.

More on the story of Han Xin:

## Best Free Chinese Dictionary App

If you are looking for a Chinese Dictionary App on your mobile phone, do check out Pleco! It is a very good Chinese Dictionary, and best of all it is free!

iOS Pleco (For iPhone, iPad): https://itunes.apple.com/en/app/pleco-chinese-dictionary/id341922306?mt=8

An immensely powerful dictionary now fits in your pocket phone! It is unbelievably good for a free app, and very highly rated on the App Store.

Do use it regularly, and your Chinese standard is bound to improve.

## The Most Complicated Chinese Character with the most strokes

Many students who study Chinese find the hardest part of learning Chinese to be writing the Chinese characters (Hanzi). Although currently China and Singapore are using the Simplified Chinese characters, there still exist many mind boggling Chinese characters that are comprised of many strokes.

Some candidates for the most complicated Chinese Character include:

The first two actually have 64 strokes each, and it would be hard to find a competitor that has more strokes than 64. (If any reader finds out, please inform me!) Incidentally, the first character is made up of four “Dragons”. The third character in the list has 52 strokes, which is not too bad.

However, all three have repetitions of a single word, and hence are not that complicated in the strictest sense of the word.

If we are looking at the most complicated (non-repetitive) Chinese word, I think the title belongs to Biang, which is used in the term Biangbiang noodles. I have eaten it once in a Chinese restaurant in Singapore, it is a bit like dry Ban Mian.

Biang has 58 strokes, and as one can see, is nothing but simple. Thank God this word is not commonly found in spelling tests!