X-Git-Url: https://git.distorted.org.uk/u/mdw/catacomb/blobdiff_plain/21f82da45054e310c8294c44bb071d7317089e74..e85f65dc3662443fa2172bdd45cd97ecb1e1eea6:/math/gfreduce.c

diff --git a/math/gfreduce.c b/math/gfreduce.c
index 164122d..aed3f22 100644
--- a/math/gfreduce.c
+++ b/math/gfreduce.c
@@ -50,7 +50,7 @@ DA_DECL(instr_v, gfreduce_instr);
  *
  * Suppose we have a polynomial @X@ we're trying to reduce mod @P@.  If we
  * take the topmost nonzero word of @X@, call it @w@, then we can eliminate
- * it by subtracting off @w P x^{k}@ for an appropriate value of @k@.  The
+ * it by subtracting off %$w P x^{k}$% for an appropriate value of @k@.  The
  * trick is in observing that if @P@ is sparse we can do this multiplication
  * and subtraction efficiently, just by XORing appropriate shifts of @w@ into
  * @X@.