From 4293d5cdf759ab2f2aacbe77d038dee67dfd3107 Mon Sep 17 00:00:00 2001 From: Fabian Gundlach Date: Sat, 21 Oct 2023 15:48:13 +0200 Subject: [PATCH] Chinese remaindering also works for large primes --- doc/source/fmpz.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/source/fmpz.rst b/doc/source/fmpz.rst index 1f1cc6fb9f..e8844be1d2 100644 --- a/doc/source/fmpz.rst +++ b/doc/source/fmpz.rst @@ -1261,7 +1261,7 @@ Chinese remaindering -------------------------------------------------------------------------------- The following functions can be used to reconstruct an integer from its -residues modulo a set of small (word-size) prime numbers. The first two +residues modulo a set of prime numbers. The first two functions, :func:`fmpz_CRT_ui` and :func:`fmpz_CRT`, are easy to use and allow building the result one residue at a time, which is useful when the number of needed primes is not known in advance.