Computer algebra systems support exact sums and products of integers that are hundreds of digits long. One way to do such extended precision arithmetic is to generate a set of mutually relatively prime bases, and to do modular arithmetic modulo all of these bases. For example, consider the vector
Factor
=
Consider the two numbers 23890864094 and 1883289456. You can represent these numbers by reducing the numbers modulo each of the bases. Thus,
23890864094 | ![]() |
![]() ![]() ![]() |
|
1pt | |||
1883289456 | ![]() |
![]() ![]() ![]() |
x | ≡ | 739 ![]() ![]() ![]() |
|
x | ≡ | 909![]() ![]() ![]() |
|
x | ≡ | 864![]() ![]() ![]() |
|
x | ≡ | 652 ![]() ![]() ![]() |
|
x | ≡ | 671 ![]() ![]() ![]() |
|
x | ≡ | 207 ![]() ![]() ![]() |
|
x | ≡ | 1003![]() ![]() ![]() |