In <http://srfi-email.schemers.org/srfi-141/msg/4211151>,
   Sudarshan S Chawathe <xxxxxx@eip10.org> writes:
   | Subject: SRFI 141 truncate and round

   | The following claim in the description of the truncate family (and a
   | similar one for the round family) confused me:
   |
   |   However, by any divisor, the quotient of +1, 0, or -1 is 0; that is,
   |   three contiguous dividends by a common divisor share a common
   |   quotient.
   |
   | Unless I'm missing something, the above is not true if the divisor is 1
   | or -1.

You're not missing something -- I was missing something!  I guess it
should say `by any non-unit divisor', or clearer words to that effect.

   | Minor issue: The sentence just before the Implementation section reads:
   |
   |   Computer scientists will immediately recognize this as the interval of
   |   integers representable in two's-complement with (k - 1) bits.
   |
   | but "(k - 1) bits" should read "k bits" if I'm not mistaken.

Correct.  I mixed up the exponent of 2 in the bounds with the number
of bits in the representation.