fix ALGORITHM block

sagemath · Sep 1, 2015 · 780d26b · 780d26b
1 parent 797eb74
commit 780d26b
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/src/sage/rings/asymptotic/asymptotic_ring.py b/src/sage/rings/asymptotic/asymptotic_ring.py
@@ -1185,7 +1185,7 @@ def log(self, base=None, precision=None):
             is possible if and only if there is exactly one maximal
             summand in the expression.
 
-        .. ALGORITHM::
+        ALGORITHM:
 
             If the expression has more than one summands,
             the asymptotic expansion for `\log(1+t)` as `t` tends to `0`

diff --git a/src/sage/rings/asymptotic/growth_group.py b/src/sage/rings/asymptotic/growth_group.py
@@ -636,7 +636,7 @@ def log_factor(self, base=None):
     A tuple of pairs, where the first entry is a growth
     element and the second a multiplicative coefficient.
 
-    .. ALGORITHM::
+    ALGORITHM:
 
         This function factors the given element and calculates
         the logarithm of each of these factors.