Anonymous user
Talk:Untouchable numbers: Difference between revisions
m
→Number of untouchable numbers up to 2 3 million
(New section about faster proper divisor sum calculation.) |
|||
Line 58:
I'll stick my neck out and say up to 3 million is 462110. As for those who say this algorithm is too slow: 3mins for 1 million 11½ mins for 2 million and 24mins for 3 million, how fast do they want an algorithm which works to be compared to a page full of algorithms which don't? Mark them as incorrect that's what I say!--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 16:00, 25 February 2021 (UTC)
::those who say this algorithm is too slow, somewhat against 4 s on TIO.RUN<br>
::it is but how to estimated a good Multiple of LIMIT to find all.
--[[User:Horsth|Horsth]] ([[User talk:Horsth|talk]]) 14:06, 2 September 2021 (UTC)
==Nice recursive solution==
| |||