유한소수에서의 나눗셈 알고리즘(Division algorithm)

In this paper, we extended the division algorithm for the integers to the finite decimals. Though the remainder for the finite decimals is able to be defined as various ways, the remainder could be defined as ``the remained amount`` which is the result of the division and as 『the remainder』 only if ``the remained amount`` is decided uniquely by certain conditions. From the definition of 『the remainder』 for the finite decimal, it could be inferred that ``the division by equal part`` and ``the division into equal parts`` are proper for the division of the finite decimal concerned with the definition of 『the remainder』. The finite decimal, based on the unit of measure, seemed to make it possible for us to think 『the remainder』 both ways: 1) in the division by equal part when the quotient is the discrete amount, and 2) in the division into equal parts when the quotient is not only the discrete amount but also the continuous amount. In this division context, it could be said that the remainder for finite decimal must have the meaning of the justice and the completeness as well. The theorem of the division algorithm for the finite decimal could be accomplished, based on both the unit of measure of 『the remainder』, and those of the divisor and the dividend. In this paper, the meaning of the division algorithm for the finite decimal was investigated, it is concluded that this theory make it easy to find the remainder in the usual unit as well as in the unusual unit of measure.