Introduction To Algorithms Used In Military Management

#

This introduction is non-exhaustive. It serves as an insight to how we can learn from algorithmic approaches from the past.

Chinese Remainder Theorem

The Chinese remainder theorem (CRT) was first published by Chinese military strategist, Sun Tzu in 孙子算经 (sūn zi suàn jīng). Before an organizational formation was set, generals were set to 点兵 (diǎn bīng), i.e. to select their soldiers. How this was done was to set a chain reaction of the head marshal selecting 3 generals, of which each will appoint 10, and each 10 will select the next 10. When it comes to a certain contingent or team, each unit can have 50. This quickly ascertain the manpower for the campaign. During the war, re-formation was required and the tally was called for. This was where the CRT was used.

This was attributed to how Han Xin (231 BC — 196 BC) gave an example:

N mod 3 = 2
N mod 5 = 3
N mod 7 = 2

as we add back:
3: 2, 5,8,11,14,17,20,[23],26,29, ...
5: 3,8,13,18,[23],28,...
7: 2,9,16,[23],30, ....

GCD(3,5,7)
3*5*7 = 105

23 + (105*n)

三人同行七十稀
五树梅花二十一
七子团圆正半月
减百零五便得知
"""
3 people go together 70
5 Tree Plum Blossom 21
The 7 sons are reunited in the first half moon
Subtract 105 and you will know
"""

a,b,c = 2,3,2 // remainders

70a + 21b + 15c - 105n = 23 where n…