________________
FEBRUARY, 1891.] THE BURMESE SYSTEM OF ARITHMETIC.
Observe that the rule as to placing the cipher of the result over the multiplier still holds good. It will always do so.
Second process : add the result to the ciphers immediately above them separately, and substitute thus: (a) 16091, (b) 11091, (c) 21091.
1
5 55
55
55
Third process : multiply the second cipher of the multiplicand by the second cipher of the multiplier, setting down the result thus: 21091.
45 55
Fourth process: substitute the last cipher of the result for the second cipher of the multiplicand: add the first cipher of the result to the cipher above it, and substitute thus: 21451.
55
Now push the multiplier forward one point and you are ready for the third stage, thus
21451. 55
Third stage: multiplying the third cipher of the multiplicand.
First process: multiply the third cipher of the multiplicaud by the first cipher of the multiplier, setting down the result thus: 21451.
5 55
55
Second process : add the result to the cipher immediately above it and substitute thus: (a) 21401, (b) 21501.
1
55
Third process mutiply the third cipher of the multiplicand by the second cipher of the multiplier, setting down the result thus:
21501.
61
Fourth process: substitute the cipher of result for the third cipher of the multiplicand, thus: 21505.
55
Final Result: 21505.
Demonstration by the European method:
391
55
1955
5 55
1955
21505.
In going through the above calculation the processes actually shewn successively on the slate, sand, parabaik or other material by a Burman would be as follows:
() 21091, (j) 21091, () 21451,
55
55
4.5 55
(a) 391, (6) 15391, (c) 15391, (d) 16591, (e) 16591, (f) 16591, (g) 16091, (h) 11091'
55
55
15
55
55
45 55
1
5 55
55
(2) 21451,
55
(m) 21451, (n) 21401,
1
5 55
55
58
(o) 21501,
55
(p) 21501, (g) 21505, (r) 21505.
55
5 55
Thus he would have to go through 18 alterations of the ciphers before arriving at the result.