//
// Where d0*2^k was replaced by c on the right hand side.
-// udivisibleOK reports whether we should strength reduce an unsigned n-bit divisibilty check by c.
+// udivisibleOK reports whether we should strength reduce an unsigned n-bit divisibility check by c.
func udivisibleOK(n uint, c int64) bool {
// Convert from ConstX auxint values to the real uint64 constant they represent.
d := uint64(c) << (64 - n) >> (64 - n)
// Note that the calculation is performed using unsigned integers.
// Since a' can have n-1 bits, 2a' may have n bits and there is no risk of overflow.
-// sdivisibleOK reports whether we should strength reduce a signed n-bit divisibilty check by c.
+// sdivisibleOK reports whether we should strength reduce a signed n-bit divisibility check by c.
func sdivisibleOK(n uint, c int64) bool {
if c < 0 {
// Doesn't work for negative c.