Middle-square method: Difference between revisions

Content deleted Content added
Fastfission (talk | contribs)
I don't think this code clarifies anything
Fastfission (talk | contribs)
add a little graphic
Line 1:
[[Image:Middle-square method.svg|right|250px|thumb|One iteration of the middle-square method, showing a six digit seed, which is then squared, and the resulting value has its middle six digits as the output value (and also as the next seed for the sequence).]]
 
In [[mathematics]], the [[middle-square method]] is a method of generating [[pseudorandom number]]s. In practice it is not a good method, since its period is usually very short and it has some crippling weaknesses. The method was first suggested by [[John Von Neumann]] in 1946.