Here's some doc and typo fixes I found recently.

-- 
You received this message because you are subscribed to the Google Groups 
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
diff --git a/ChangeLog b/ChangeLog
index 9e3b8e00..df57d73a 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,6 +1,6 @@
 2017-03-04  Waldek Hebisch  <[email protected]>
 
-	* src/algebra/*.spad: Remove commended out 'one?'
+	* src/algebra/*.spad: Remove commented out 'one?'
 
 2017-03-03  Qian Yun  <[email protected]>
 
diff --git a/src/algebra/aggcat.spad b/src/algebra/aggcat.spad
index 665ec99a..16840cee 100644
--- a/src/algebra/aggcat.spad
+++ b/src/algebra/aggcat.spad
@@ -1145,10 +1145,10 @@ BinaryRecursiveAggregate(S : Type) : Category == RecursiveAggregate S with
       setleft! : (%, %) -> %
          ++ setleft!(a, b) sets the left child of \spad{a} to be b.
       setelt! : (%, "right", %) -> %
-         ++ setelt!(a, "right", b) (also written \spad{b.right := b})
+         ++ setelt!(a, "right", b) (also written \spad{a.right := b})
          ++ is equivalent to \spad{setright!(a, b)}.
       setright! : (%, %) -> %
-         ++ setright!(a, x) sets the right child of t to be x.
+         ++ setright!(a, b) sets the right child of \spad{a} to be b.
  add
    cycleMax ==> 1000
 
diff --git a/src/algebra/intfact.spad b/src/algebra/intfact.spad
index 595575e0..f05c0911 100644
--- a/src/algebra/intfact.spad
+++ b/src/algebra/intfact.spad
@@ -236,8 +236,6 @@ IntegerRoots(I : IntegerNumberSystem) : Exports == Implementation where
     approxSqrt : I -> I
       ++ \spad{approxSqrt(n)} returns an approximation x
       ++ to \spad{sqrt(n)} such that \spad{-1 < x - sqrt(n) < 1}.
-      ++ Compute an approximation s to \spad{sqrt(n)} such that
-      ++           \spad{-1 < s - sqrt(n) < 1}
       ++ A variable precision Newton iteration is used.
       ++ The running time is \spad{O( log(n)^2 )}.
 
diff --git a/src/algebra/newpoly.spad b/src/algebra/newpoly.spad
index d994b08a..a014ca34 100644
--- a/src/algebra/newpoly.spad
+++ b/src/algebra/newpoly.spad
@@ -22,7 +22,7 @@ NewSparseUnivariatePolynomial(R) : Exports == Implementation where
    CoercibleTo(SUPR), RetractableTo(SUPR)) with
      monicModulo : (%, %) -> %
         ++ \spad{monicModulo(a, b)} returns \spad{r} such that \spad{r} is
-        ++ reduced w.r.t. \spad{b} and \spad{b} divides \spad{a -r}
+        ++ reduced w.r.t. \spad{b} and \spad{b} divides \spad{a - r}
         ++ where \spad{b} is monic.
      lazyResidueClass : (%, %) -> Record(polnum : %, polden : R, power : NNI)
         ++ \spad{lazyResidueClass(a, b)} returns \spad{[r, c, n]} such that

Reply via email to