At 6:52 PM -0700 3/29/99, [EMAIL PROTECTED] wrote: >Is it possible to choose a seed, multiplier, and modulus for a linear >congruential generator such that it duplicates any finite list of >positive integers? > >[No, but I'll let others expand or do it in another message. --Perry] > >-- >Mike Stay You can see that Perry is right by a simple counting argument. Say the word size is m bits. There are 2**(3*m) cvombinations of seed, multiplier, and modulus and there are (2**m)! possible arangements of the values. The latter is much bigger for m > 2. Arnold Reinhold
