remainder theorem

remainder theorem

[ri′mān·dər ‚thir·əm]
(mathematics)
Dividing a polynomial p (x) by (x-a) gives a remainder equaling the number p (a).
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
In this paper, a secured and energy efficient WSNs based on Chinese Remainder Theorem (CRT) bundle part sending procedure is proposed.
This article does not propose to discuss the origins of the method for long division of polynomials known to many as synthetic division, nor to discuss whether it should be known as Horner's method as ascribed to William Horner by Augustus De Morgan (Robertson & O'Connor, 2005) or as some cousin of the Chinese remainder theorem developed by Qin Jiushao (Joseph, 2011).
Restating is easily carried out by (1.3) and the Chinese remainder theorem.
[p.sub.d] by n, the Chinese Remainder Theorem isomorphism
The key to the team's innovation is the pooling strategy, which is based on the 2,000-year-old Chinese remainder theorem.
On the other hand, if [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], by Taylor's remainder theorem,
RSA algorithms with key lengths of 1.024 bits are processed in 65 milliseconds without Chinese Remainder Theorem (CRT).
At the end, only one multilength computation is required to construct the global solution (the exact answer) by means of the Chinese Remainder Theorem. This technique was first described in a paper by Newman in 1 967 (26); it was employed with great success in computing and checking the tables in Chap.
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).
Finally, we give an alternative interpretation of the Lagrange Remainder Theorem. This interpretation allows us to find and solve numerically for the number whose existence is guaranteed by the Theorem.
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.