galois.crt

galois.crt(remainders: Sequence[int], moduli: Sequence[int]) → int
galois.crt(remainders: Sequence[Poly], moduli: Sequence[Poly]) → Poly

Solves the simultaneous system of congruences for \(x\).

Parameters
remainders

The integer or polynomial remainders \(a_i\).

moduli

The integer or polynomial moduli \(m_i\).

Returns

The simultaneous solution \(x\) to the system of congruences.

Notes

This function implements the Chinese Remainder Theorem.

\[\begin{split}x &\equiv a_1\ (\textrm{mod}\ m_1) \\ x &\equiv a_2\ (\textrm{mod}\ m_2) \\ x &\equiv \ldots \\ x &\equiv a_n\ (\textrm{mod}\ m_n)\end{split}\]

References

Examples

Define a system of integer congruences.

In [1]: a = [0, 3, 4]

In [2]: m = [3, 4, 5]

Solve the system of congruences.

In [3]: x = galois.crt(a, m); x
Out[3]: 39

Show that the solution satisfies each congruence.

In [4]: for i in range(len(a)):
   ...:     ai = x % m[i]
   ...:     print(ai, ai == a[i])
   ...: 
0 True
3 True
4 True

Define a system of polynomial congruences over \(\mathrm{GF}(7)\).

In [5]: GF = galois.GF(7)

In [6]: x_truth = galois.Poly.Random(6, field=GF); x_truth
Out[6]: Poly(2x^6 + 3x^5 + x^4 + 3x^3 + 4x^2 + 6x + 6, GF(7))

In [7]: m = [galois.Poly.Random(3, field=GF), galois.Poly.Random(4, field=GF), galois.Poly.Random(5, field=GF)]; m
Out[7]: 
[Poly(6x^3 + 4x^2 + 4x + 2, GF(7)),
 Poly(x^4 + 5x^3 + 3x^2 + 3x + 5, GF(7)),
 Poly(5x^5 + 3x^3 + 2x^2 + 6, GF(7))]

In [8]: a = [x_truth % mi for mi in m]; a
Out[8]: 
[Poly(2x^2 + 2x, GF(7)),
 Poly(x^3 + 2x^2 + 3, GF(7)),
 Poly(4x^4 + 6x^3 + 5x + 1, GF(7))]

Solve the system of congruences.

In [9]: x = galois.crt(a, m); x
Out[9]: Poly(2x^6 + 3x^5 + x^4 + 3x^3 + 4x^2 + 6x + 6, GF(7))

Show that the solution satisfies each congruence.

In [10]: for i in range(len(a)):
   ....:     ai = x % m[i]
   ....:     print(ai, ai == a[i])
   ....: 
2x^2 + 2x True
x^3 + 2x^2 + 3 True
4x^4 + 6x^3 + 5x + 1 True
Last update: May 18, 2022