Syntactic Confectionery Delight  
PerlMonks 
comment on 
( [id://3333] : superdoc . print w/replies, xml )  Need Help?? 
A mapping of the form
is 1to1 (restricted to 0 <= x < m) as long as gcd(a,m)==1, since that's the only time you can find an inverse to a mod m, and invert the function. I would suggest splitting your "seed" value into the a & b coefficients in the following way:
But take this approach for what it's worth  The only kinds of mapping you'll get by this process are simple linear (affine) mappings, which may not "look random enough": For more "unpredictable" orders, you could have more tools at your disposal if $max is always a prime. Then you take one of the linear sequences above and use it as a sequence of powers of a generator element for the field mod $max. blokhead In reply to Re^3: Random 11 mapping
by blokhead

Log In^{?}
Chatterbox^{?}
Other Users^{?}
Sections^{?}
Information^{?}
Find Nodes^{?}
Leftovers^{?}
Voting Booth^{?}
My favourite way to spend a leap day ...
Results (22 votes). Check out past polls. 