Talk:First perfect square in base n with n unique digits: Difference between revisions
Content added Content deleted
(→analytically determine minimum start value: Added further comment.) |
Thundergnat (talk | contribs) (→analytically determine minimum start value: Ah. My mishandling of square root calculations.) |
||
| Line 329: | Line 329: | ||
I don't know whether any substantial optimizations are still possible, though I'm continuing to think about it as it would be nice to get the run time down for the higher bases. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 15:42, 26 May 2019 (UTC) |
I don't know whether any substantial optimizations are still possible, though I'm continuing to think about it as it would be nice to get the run time down for the higher bases. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 15:42, 26 May 2019 (UTC) |
||
:Argh. Made faulty assumptions about how square root of big integers are handled in Perl 6. It was only in the display code, not the calculations, so I got the right ''square'' but then displayed an incorrect square root. Will fix that. Thanks. |
|||
:This turned out to be a more interesting task than I initially anticipated. I learned quite a bit more about number theory than I knew before. We have an interesting cross-section of talented people on here. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 16:41, 26 May 2019 (UTC) |
|||
==Calculating quadratic residues== |
==Calculating quadratic residues== |
||