We would like m to be very large so that there is the potential for producing a long series of distinct random numbers. A common criterion is that m be nearly equal to the maximum representable nonnegative integer for a given computer. Thus, a value of m near to or equal to 231 is typically chosen. Many experts recommend a value of 231 − 1. You may wonder why one should not simply use 231, because this latter number can be represented with no additional bits, and the mod operation should be easier to perform. In general, the modulus 2k − 1 is preferable to 2k. Why is this so?