Changeset 62a98a in git

Timestamp:

Mar 13, 2007, 7:48:27 PM (17 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '17f1d200f27c5bd38f5dfc6e8a0879242279d1d8')

Children:

337d5b4a735ba3e7400e978b3d410c233023b3d7

Parents:

0176c0c8a46617b634ef5297ea5fe87f32a0d215

Message:

*hannes: fixed example and docu of chineseR


git-svn-id: file:///usr/local/Singular/svn/trunk@9943 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/modstd.lib (modified) (4 diffs)

Singular/LIB/modstd.lib

@@ -1 +1 @@
 //GP, last modified 23.10.06
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: modstd.lib,v 1.6 2007-01-23 15:03:30 Singular Exp $";
+version="$Id: modstd.lib,v 1.7 2007-03-13 18:48:27 Singular Exp $";
 category="Commutative Algebra";
 info="
@@ -425 +425 @@
            return(N/B);
         }
-        D=E mod N;
-        C=A-(E-E mod N)/N*B;
-        E=N;
-        N=D;
-        A=B;
-        B=C;
+        D=E mod N;
+        C=A-(E-E mod N)/N*B;
+        E=N;
+        N=D;
+        A=B;
+        B=C;
    }
    return(0);
@@ -441 +441 @@
  ///////////////////////////////////////////////////////////////////////////////
 proc chineseR(list T,list L,number N)
-"USAGE:  chineseR(T,L);
-RETURN: x such that x = T[i] mod L[i]
+"USAGE:  chineseR(T,L,N);
+RETURN: x such that x = T[i] mod L[i], N=product(L[i])
 NOTE:   chinese remainder theorem
 EXAMPLE:example chineseR; shows an example
@@ -471 +471 @@
 { "EXAMPLE:"; echo = 2;
    ring R = 0,x,dp;
-   chineseR(list(24,15,7),list(2,3,5));
+   chineseR(list(24,15,7),list(2,3,5),30);
 }