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