Chinese Remainder Problem Solve the Chinese remainder problem cleverly
Download

Chinese Remainder Problem Ranking & Summary

Chinese Remainder Problem Tags

solver solve equation solve equation solve optimization problem Equation Solver solve flight problem solve math problem solve BITS problem solve problem solve geometry problem solve linear problem solve algebra problem solve computational problem solve chemistry problem chinese remainder solve network problem solve estimation problem solve trigonometry problem solve four color problem solve vector problem

Chinese Remainder Problem Description

This little tool was developed to be a small test application that will allow you to solve the Chinese remainder problem cleverly.Around A.D. 100, the Chinese mathematician Sun-Tsu solved the problem of finding those integers x that leave remainders 2, 3, and 2 when divided by 3, 5, and 7 respectively. One such solution is x = 23; all solutions are of the form 23 + 105k for arbitrary integers k. The Chinese remainder problem says that integers a,b,c are pairwise coprime, N leaves remainders r1, r2, r3 when divided by a, b, c respectively, finding N. The problem can be described by the following equation: N = a * x + r1 = b * y + r2 = c * z + r3

Chinese Remainder Problem Related Software