Changeset c335c5 in git

Timestamp:

Apr 6, 2009, 3:21:58 PM (14 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')

Children:

c1f6a9ca685ae005c4cbd13e1df1355305542a7c

Parents:

08e081516771eec845058a046616a8c0d7e8325b

Message:

*hannes: syntax fix


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

File:

• Singular/LIB/zeroset.lib (modified) (7 diffs)

Singular/LIB/zeroset.lib

@@ -1 +1 @@
 // Last change 12.02.2001 (Eric Westenberger)
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: zeroset.lib,v 1.19 2009-04-06 09:17:01 seelisch Exp $";
+version="$Id: zeroset.lib,v 1.20 2009-04-06 13:21:58 Singular Exp $";
 category="Symbolic-numerical solving";
 info="
@@ -18 +18 @@
  of Singular for univariate factorization of polynomials over simple algebraic
  extensions in characteristic 0.
- 
+
  NOTE:
  Subprocedures with postfix 'Main' require that the ring contains a variable
@@ -25 +25 @@
 
 PROCEDURES:
- quotient(f, g)    quotient q  of f w.r.t. g (in f = q*g + remainder)
+ Quotient(f, g)    quotient q  of f w.r.t. g (in f = q*g + remainder)
  remainder(f,g)    remainder of the division of f by g
  roots(f)    computes all roots of f in an extension field of Q
@@ -470 +470 @@
 ///////////////////////////////////////////////////////////////////////////////
 
-proc quotient(poly f, poly g)
-"USAGE:   quotient(f, g); where f,g are polynomials;
+proc Quotient(poly f, poly g)
+"USAGE:   Quotient(f, g); where f,g are polynomials;
 PURPOSE: compute the quotient q and remainder r s.t. f = g*q + r, deg(r) < deg(g)
 RETURN:  list of polynomials
@@ -480 +480 @@
 ASSUME:  basering = Q[x] or Q(a)[x]
 NOTE: outdated, use div/mod instead
-EXAMPLE: example  quotient; shows an example
+EXAMPLE: example  Quotient; shows an example
 "
 {
@@ -502 +502 @@
  poly f =  x4 - 2;
  poly g = x - a;
- list qr = quotient(f, g);
+ list qr = Quotient(f, g);
  qr;
  qr[1]*g + qr[2] - f;
@@ -518 +518 @@
          this represents the ring Q(a)[x] together with its minimal polynomial.
 NOTE: outdated, use div/mod instead
-EXAMPLE: example  quotient; shows an example
 "
 {