/* -*-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
*
/*----- 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.
*
*
* 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