Abstract
Pseudo-random numbers are widely used in Operations Research and applied mathema tics. With the growth in power of computers and languages, there is some tendency to use lower-significant bits within the pseudo- random number. Theoretical and empirical tests have not been sufficient to assess the randomness of these low-order bits. We show here for two generators that the low- order bits can be empirically tested, after first undertaking a bit-level transformation of the numbers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
