X-Git-Url: https://git.distorted.org.uk/u/mdw/catacomb/blobdiff_plain/6a2be2e7e620240d84b7d1425901a9f886610d69..eaa515d8f14b12289534502060def4e10654416e:/mptext.c

diff --git a/mptext.c b/mptext.c
index 57521da..f6bc2e3 100644
--- a/mptext.c
+++ b/mptext.c
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: mptext.c,v 1.10 2001/06/16 13:22:39 mdw Exp $
+ * $Id: mptext.c,v 1.11 2001/06/16 23:42:17 mdw Exp $
  *
  * Textual representation of multiprecision numbers
  *
@@ -30,6 +30,9 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: mptext.c,v $
+ * Revision 1.11  2001/06/16 23:42:17  mdw
+ * Typesetting fixes.
+ *
  * Revision 1.10  2001/06/16 13:22:39  mdw
  * Added fast-track code for binary output bases, and tests.
  *
@@ -82,7 +85,7 @@
  *
  * This is the number of bits in a @size_t@ object.  Why? 
  *
- * To see this, let %$b = \mathit{MPW\_MAX} + 1$% and let %$Z$% be the
+ * To see this, let %$b = \textit{MPW\_MAX} + 1$% and let %$Z$% be the
  * largest @size_t@ value.  Then the largest possible @mp@ is %$M - 1$% where
  * %$M = b^Z$%.  Let %$r$% be a radix to read or write.  Since the recursion
  * squares the radix at each step, the highest number reached by the