Revision as of 00:15, 29 September 2022 edit Partofthemachine (talk \| contribs) Extended confirmed users, Pending changes reviewers 19,239 edits Rm extra space ← Previous edit		Revision as of 00:16, 29 September 2022 edit undo Partofthemachine (talk \| contribs) Extended confirmed users, Pending changes reviewers 19,239 edits More encyclopedic phrasing Next edit →
Line 2: [[Image:Middle_square_method_2_digits.svg\|right\|250px\|thumb\|[[Directed graph]] of all 100 2-digit pseudorandom numbers obtained using the middle-square method with ''n'' = 2.]] In [[mathematics]] and computer science, the '''middle-square method''' is a method of generating [[pseudorandom number]]s. In practice it is ~~not~~ a ~~good~~highly flawed method for many practical purposes, since its [[Pseudorandom number generator#Periodicity\|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. == History ==

Middle-square method: Difference between revisions