Chinese remainder theorem


Also found in: Acronyms, Wikipedia.

Chinese remainder theorem

[¦chī‚nēz ri′mān·der ‚thir·əm]
(mathematics)
The theorem that if the integers m1, m2, …, mn are relatively prime in pairs and if b1, b2, …, bn are integers, then there exists an integer that is congruent to bi modulo mi for i =1,2, …, n.
References in periodicals archive ?
(2013), Applying the Chinese remainder theorem to data aggregation in wireless sensor networks IEEE Commun.
Proof: The result is easy when n is prime and can be deduced from the Chinese Remainder Theorem in the general case.
As noted in the introduction, the Chinese Remainder Theorem isomorphism (1) identifies elements of Z/nZ with the (d - 1)-dimensional simplices of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].
Part III discusses pulse Doppler radar concepts, and includes discussions of phase noise, and the use of several pulse-repetition frequencies with the Chinese Remainder Theorem to resolve range and velocity ambiguities.
The two most widely used techniques of reverse conversion are the Mixed Radix Conversion (MRC) and Chinese Remainder Theorem (CRT) and Gbolagade, 2009; Gbolagade 2009).
Mohammed, Heba and Jawad (2016) presented an acceleration of the RSA Processes based on Parallel Decomposition and Chinese Remainder theorem. They proposed variant decompositions to gain extra speed.
Mohammed, Issam Younis, Heba, Mohammed Fadhil, Jawad, Zainab Nadhim (2016) Acceleration of the RSA Processes based on Parallel Decomposition and Chinese Remainder Theorem, International Journal of Application or Innovation in Engineering & Management, 5(1), January, 12-23.