Talk:First perfect square in base n with n unique digits: Difference between revisions
Content added Content deleted
(→Optimization when no extra digit required: clearing for myself) |
(Congratulations to Nigel Galloway on his latest optimization!) |
||
| Line 376: | Line 376: | ||
dgt root of the square: 0 1 4 9 2 11 8 7 8 11 2 9 4 1 .. 0<br> |
dgt root of the square: 0 1 4 9 2 11 8 7 8 11 2 9 4 1 .. 0<br> |
||
So one has only to check every 14.th value.<b>Bravo</b>!<br> |
So one has only to check every 14.th value.<b>Bravo</b>!<br> |
||
:Simple but brilliant, Nigel :) |
|||
:Even on my old machine, this has cut the time needed (in Go) to reach base 25 from 60 to under 4 minutes and bases 26 and 27 are now dispatched in under 16 and 30 minutes respectively. |
|||
:I wouldn't spend too much time on optimizing for the cases where an additional digit is required as they take very little time to process anyway as a result of previous optimizations. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 10:58, 29 May 2019 (UTC) |
|||