余数问题的两种算法分析

Two Algorithm Analysis for Question of Remainder

本文对“已知一个正整数被不同的几个正整数除后的余数,求该数”的传统余数问题进行分析,分别采用穷举算法和中国剩余定理(孙子定理)的数学分析算法进行计算机编程求解,并分析、比较两种算法的特点。

This paper introduces traditional question of remainder--＂ known remainder of a positive integer to be different positive integer divide, seeking this positive integer＂, compares and analyzes exhaustive algorithm and the Chinese remainder theorem （Sunzi theorem） with mathematical analysis algorithm, and computer programming.