chrem - Chinese Remainder Algorithm
|
Calling Sequence
|
|
chrem(u, m)
|
|
Parameters
|
|
u
|
-
|
list [u1,..., un] of evaluations
|
m
|
-
|
list of moduli [m1,..., mn]
|
|
|
|
|
Description
|
|
•
|
The list of moduli m must be pairwise relatively prime positive integers. Both lists u and m must be the same length . The list of images u need not be reduced modulo m on input. In the following, denotes the product of the moduli.
|
•
|
If u is a list of integers, chrem(u, m) computes the unique positive integer a such that , and .
|
•
|
For a definition, see Chinese remainder theorem.
|
|
|
Examples
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
| (5) |
|
|
Download Help Document
Was this information helpful?