Pseudo-random numbers/Middle-square method: Difference between revisions
Pseudo-random numbers/Middle-square method (view source)
Revision as of 11:12, 4 January 2023
, 1 year agoReplace Wikipedia link with template
Jazzedpineda (talk | contribs) (Add EasyLang) |
Jazzedpineda (talk | contribs) (Replace Wikipedia link with template) |
||
Line 1:
{{task}}
{{Wikipedia|Middle-square method|en}}
; The Method:
To generate a sequence of n-digit pseudorandom numbers, an n-digit starting value is created and squared, producing a 2n-digit number. If the result has fewer than 2n digits, leading zeroes are added to compensate. The middle n digits of the result would be the next number in the sequence and returned as the result. This process is then repeated to generate more numbers.
|