|
We've been playing with CEERANO to try to construct a list of 13 digit unique numbers in "random" order. It looks like that after 20,000 or so, diminishing returns sets in in a big way. What we're doing is starting with zero as the seed and using whatever gets returned in the seed parm as the next seed. The test program looks at its output file to see if the current random number is in the file. If not, it writes it. Out of curiosity I tried a run of 99,999--off by 1 <g>--just to see what I'd get. 1322 of the numbers occurred 70 times, 29 of them occurred 69 times, and the others occurred once. I guess I'd expect the frequencies to be a little more normally distributed. Looks like using the seed value returned by the function is not a good idea. Does anyone know what's happening here? NOTICE: All e-mail sent to or from this e-mail address will be received or otherwise recorded by The Sharper Image corporate e-mail system and is subject to archival, monitoring, review by and/or disclosure to Sharper Image security and other management. This message is intended only for the use of the addressee and may contain information that is privileged and confidential. The contents of this message may contain personal views which are not the views of The Sharper Image. If you are not the intended recipient, dissemination of this communication is prohibited.
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.