Anonymous user
Talk:Rare numbers: Difference between revisions
→30 mins not 30 years: added comments and queries.
(→30 mins not 30 years: added comments and queries.) |
|||
Line 56:
</pre>--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:34, 12 September 2019 (UTC)
:I have turned the computer on and produced a solution using only the above and nothing from the referenced website which completes in under a minute. The reference is rubbish, consider removing it--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 10:42, 18 September 2019 (UTC)
:: Rubbish or not, is there anything on the referenced (Gupta's) website that is incorrect? The properties and observations is what the REXX solution used (and others have as well) to calculate ''rare'' numbers, albeit not as fast as your algorithm. I have no idea how long Shyam Sunder Gupta's program(s) executed before it found eight rare numbers (or how much virtual memory it needed). Is the algorithm suitable in finding larger ''rare'' numbers? I suspect (not knowing '''F#''') that virtual memory may become a limitation. Eight down, seventy-six more to go. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 18:18, 18 September 2019 (UTC)
== the 1<sup>st</sup> REXX version ==
| |||