# 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).
Mentioned in ?
References in periodicals archive ?
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).
Proof: The result is easy when n is prime and can be deduced from the Chinese Remainder Theorem in the general case.
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,
Finally, we give an alternative interpretation of the Lagrange Remainder Theorem.
024 bits are processed in 65 milliseconds without Chinese Remainder Theorem (CRT).
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.
At the end, only one multilength computation is required to construct the global solution (the exact answer) by means of the Chinese Remainder Theorem.
The Secturion security processing cards deliver 4400 RSA key decrypts per second (1024-bit modulus with Chinese Remainder Theorem -- CRT) which equates to initiating about 4000 secure sessions per second for Web based applications as well as initiating as many as 3400 secure tunnels for VPN solutions.
The dedicated RSA (Rivest, Shamir, Adleman) cryptography accelerator processes digital signatures with key lengths of 1,024 bits in 420 milliseconds (at 10 MHz, without Chinese Remainder Theorem CRT), RSA algorithms with key lengths of 2,048 bits can also be processed using the CRT.
A 1024-bit RSA computation with Chinese Remainder Theorem (CRT) is achieved in 90 ms.
Fast format RSA keys (Chinese remainder theorem & Fermat-5)

Site: Follow: Share:
Open / Close