diff --git a/Control/CxxUtils/Root/crc64.cxx b/Control/CxxUtils/Root/crc64.cxx
index c2846f1c13acd5e3eb4c02f532b60f658ccc5c85..cc73cb4c527db4444a5d3c89a6e01a9682864630 100644
--- a/Control/CxxUtils/Root/crc64.cxx
+++ b/Control/CxxUtils/Root/crc64.cxx
@@ -91,9 +91,9 @@
  * The way a CRC calculation works is by iteratively reducing the length
  * of the message in such a way that the CRC does not change.  For example,
  * suppose we have a message M that is split into two parts, A of T bits,
- * and B of U bits.  This, M = 2^U A + B.  Then suppose we find a shorter
+ * and B of U bits.  Thus, M = 2^U A + B.  Then suppose we find a shorter
  * string A' with T' bits, such that A mod P = A' mod P.  It is then easy
- * to show that the string M' = 2U A' + B has the same CRC:
+ * to show that the string M' = 2^U A' + B has the same CRC:
  *
  *   M  mod P = [(x^U mod P)(A  mod P)] mod P + B mod P
  *   M' mod P = [(x^U mod P)(A' mod P)] mod P + B mod P