1. The
divisor problem in additive square complements is studied, which improves results ever deduced.
研究了平方补数集合中的除数问题,改进并推广了原有的结果。
2. GCD and LCM. Determine the greatest common
divisor and least common multiple of a pair of integers.
最大公约数和最小公倍数请计算两个整数的最大公约数和最小公倍数。
3. A unit that performs division operation. The inputs to it are
divisor and dividend, the outputs from it are quotient and remainder.
一种完成除法运算的部件,它的输入是除数和被除数,输出是商和馀数。