summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarco Bodrato <bodrato@mail.dm.unipi.it>2022-03-20 20:15:17 +0100
committerMarco Bodrato <bodrato@mail.dm.unipi.it>2022-03-20 20:15:17 +0100
commit93d25ba01870aa9a41db496b2427153811f70277 (patch)
treef815b2a1540950769b2749b9b7af307034d49223
parent44bbc12a7a0ffb47facae62d9d54b4ed32c7f4a7 (diff)
downloadgmp-93d25ba01870aa9a41db496b2427153811f70277.tar.gz
mpn/generic/mulmod_bknp1.c: Remove non-english comment
-rw-r--r--mpn/generic/mulmod_bknp1.c16
1 files changed, 0 insertions, 16 deletions
diff --git a/mpn/generic/mulmod_bknp1.c b/mpn/generic/mulmod_bknp1.c
index a7517aefc..feb10eb85 100644
--- a/mpn/generic/mulmod_bknp1.c
+++ b/mpn/generic/mulmod_bknp1.c
@@ -273,22 +273,6 @@ _mpn_crt (mp_ptr rp, mp_srcptr ap, mp_srcptr bp,
if (mpn_sub_n (tp, bp, tp, n + 1))
_mpn_modbnp1_neg_ip (tp, n, tp[n]);
- /*
- Oni komence havis A = {ap, k*n+1},
- kaj X = {bp, n+1} mod (B^n+1),
-
- Do oni prenas T = X-A mod (B^n+1) ,
- kaj ni kalkulas
- R = T/k * (B^(k*n)+1)/(B^n+1) + A.
-
- Kompreneble, R = A mod ((B^(k*n)+1)/(B^n+1)) .
- Plue, cxar k estas ne para
- (B^(k*n)+1)/(B^n+1) = k mod (B^n+1) ;
- do R = T/k*k + A = X-A+A = X mod (B^n+1) .
-
- Kiel oni kalkulas T/k, se T ne estas oblo de k?
- Oni povas selekti T + m (B^n+1) = 0 mod (k) ;
- */
#if MOD_BKNP1_USE11
if (UNLIKELY (k == 11))
{