Changeset 0dd77c2 in git

Timestamp:

Jun 30, 2010, 2:51:00 PM (13 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

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

Children:

a33befbff5c55fd02acf5bab27860dc1da88b275

Parents:

33c80401859cb1e4a4821ef802c31f324cbd0e08

Message:

fixed typos

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

Location:

Singular/LIB

Files:

• aksaka.lib (modified) (2 diffs)
• atkins.lib (modified) (1 diff)

Singular/LIB/aksaka.lib

@@ -17 +17 @@
 PerfectPowerTest(n)        checks if there are a,b>1, so that a^b=n
 wurzel(r)                  square root of number r
-euler(r)                   phi-function of euler
+euler(r)                   phi-function of Euler
 coeffmod(f,n)              polynomial f modulo number n (coefficients mod n)
 powerpolyX(q,n,a,r)        (polynomial a)^q modulo (poly r,number n)
@@ -215 +215 @@
 proc euler(number r)
 "USAGE: euler(r);
-RETURN: number phi(r), where phi is eulers phi-function
+RETURN: number phi(r), where phi is Eulers phi-function
 NOTE:   first r is factorized with proc PollardRho, then phi(r) is
         calculated with the help of phi(p) of every factor p;

Singular/LIB/atkins.lib

@@ -663 +663 @@
 ASSUME: p>=3
 NOTE:   this algorithm will be called recursively, and it is understood
-        that all the operations are done in Z/pZ (excepting sqareRoot(d,p))
+        that all the operations are done in Z/pZ (excepting squareRoot(d,p))
 EXAMPLE:example rootsModp; shows an example
 "