CWG1636 Bits required for negative enumerator values

Author: Dawn Perchik

source/declarations.tex

@@ -6357,7 +6357,7 @@
 values in the range $b_\text{min}$ to $b_\text{max}$, defined as follows: Let $K$
 be 1 for a two's complement representation and 0 for a ones' complement
 or sign-magnitude representation. $b_\text{max}$ is the smallest value
-greater than or equal to $max(|e_\text{min}| - K, |e_\text{max}|)$ and equal to
+greater than or equal to $max(|e_\text{min}| - K, e_\text{max})$ and equal to
 $2^M-1$, where $M$ is a non-negative integer. $b_\text{min}$ is zero if
 $e_\text{min}$ is non-negative and $-(b_\text{max}+K)$ otherwise. The size of the
 smallest bit-field large enough to hold all the values of the