Talk:Pseudo-random numbers/Middle-square method: Difference between revisions
Content added Content deleted
(→Example runs into constant value: new section) |
|||
Line 7: | Line 7: | ||
#209 625000 |
#209 625000 |
||
#210 625000</pre> |
#210 625000</pre> |
||
:From wikipedia: |
|||
:In mathematics, the middle-square method is a method of generating pseudorandom numbers. In practice it is not a good method, since its period is usually very short and it has some severe weaknesses; repeated enough times, the middle-square method will either begin repeatedly generating the same number or cycle to a previous number in the sequence and loop indefinitely. |
|||
:So this algorithm is actually useless nowadays. This task aims at honoring John von Neumann.[[User:fzh2003|fzh2003]] ([[User talk:fzh2003|talk]]) 14:37, 3 January 2022 (UTC) |
Revision as of 14:38, 3 January 2022
Example runs into constant value
#206 437510 #207 415000 #208 225000 #209 625000 #210 625000
- From wikipedia:
- In mathematics, the middle-square method is a method of generating pseudorandom numbers. In practice it is not a good method, since its period is usually very short and it has some severe weaknesses; repeated enough times, the middle-square method will either begin repeatedly generating the same number or cycle to a previous number in the sequence and loop indefinitely.
- So this algorithm is actually useless nowadays. This task aims at honoring John von Neumann.fzh2003 (talk) 14:37, 3 January 2022 (UTC)