Efficient generating random number sequence

• Main Authors: Lin, Wen-Sheng, 林文勝
• Other Authors: 唐惠欽
• Format: Others
• Language: zh-TW
• Published: 2015
• Online Access: http://ndltd.ncl.edu.tw/handle/5q9zm7

碩士 === 國立高雄應用科技大學 === 工業工程與管理系碩士在職專班 === 103 === The paper considers the problem of efficient generating random number sequence. We adopt the most popular and efficient approximate factoring method. We conduct an exhaustive search for the moduli 2, 3, …,541. The results indicate that the number of portable multipliers increases as the modulus increases. As the number of portable multipliers increases one, the first non-portable multiple increases 0.55471. As the square root of the modulus increases one, the average distance of the two consecutive portable multipliers increases 0.49618.