Talk:Middle-square method: Difference between revisions

Revision as of 14:34, 18 March 2021

Latest revision as of 18:42, 29 February 2024

(6 intermediate revisions by 5 users not shown)

Line 1:

{{WikiProject Computingbanner shell|class=StubStart|importance=|auto=yes}}

{{WikiProject Computing|importance=|auto=yes}}

}}

{{Broken anchors|links=

* <nowiki>[[Pseudorandom number generator#Periodicity|period]]</nowiki> The anchor (#Periodicity) is no longer available because it was [[Special:Diff/877704034|deleted by a user]] before. <!-- {"title":"Periodicity","appear":{"revid":109738067,"parentid":109736100,"timestamp":"2007-02-21T04:24:44Z","removed_section_titles":["Inherent nonrandomness","Decimal expansion","Evaluation criteria example"],"added_section_titles":["Periodicity","GISIT evaluation criteria"]},"disappear":{"revid":877704034,"parentid":877702885,"timestamp":"2019-01-10T11:06:41Z","removed_section_titles":["Periodicity"],"added_section_titles":[]}} -->

}}

136*136

==C++ code==

Anyone who knows enough C++ to understand that code probably doesn't need it to be here. In any case, I don't think it is Wikipedia's place to provide code samples -- it is an encyclopedia. It would be better if how it worked was actually explained clearly, rather than via code, in my opinion. --[[User:Fastfission|Fastfission]] 04:40, 5 May 2006 (UTC)

Line 17 ⟶ 24:

This section reads like it was written by the publisher of the RNG himself. Have been unable to find independent evaluations thereof. --[[Special:Contributions/41.169.80.41|41.169.80.41]] ([[User talk:41.169.80.41|talk]]) 14:34, 18 March 2021 (UTC)

== Use "Tortoise and the Hare" instead of an array for finding loops ! ==

The Example code would use memory for every possible number. this limits the test to small numbers. Use [[The Tortoise and the Hare algorithm]] instead. You can test it for integers of any size with that. [[Special:Contributions/91.56.201.135|91.56.201.135]] ([[User talk:91.56.201.135|talk]]) 20:20, 30 December 2021 (UTC)

== Ekeland, Borges, Brother Edvin ==

Can anyone provide evidence, independent of Ivar Ekeland's telling of the story in ''The Broken Dice'', supporting the claim that the middle-square method was invented in the 13th century by a Norwegian monk named Brother Edvin? The claim is quite extraordinary. If it's true, it represents a landmark in the history of randomness as well as an important data point in the spread of decimal numeration in medieval Europe. But I have been unable to find any mention of Brother Edvin or his algorithm that does not derive directly from Ekeland's work.

In the absence of corroborating evidence, I can't help wondering if Brother Edvin is an elaborate joke. [[User:BetaPiEta|BetaPiEta]] ([[User talk:BetaPiEta|talk]]) 15:22, 23 June 2022 (UTC)

== 9999 ==

99999 [[Special:Contributions/116.110.0.66|116.110.0.66]] ([[User talk:116.110.0.66|talk]]) 15:56, 23 September 2022 (UTC)