User talk:Thundergnat: Difference between revisions
Content added Content deleted
No edit summary |
Thundergnat (talk | contribs) m (→First perfect square in base N with N unique digits: Added comments) |
||
| Line 462: | Line 462: | ||
i think doing bigint base conversion takes much to long time.<br> |
i think doing bigint base conversion takes much to long time.<br> |
||
I now have to include bigint, to find the start values. |
I now have to include bigint, to find the start values. |
||
:For sure the base conversions are a time sink. The Perl 6 version checks ~1.5 - 2 million possibles per second; it needs to check through ~937 million to find the answer in base 25. So yeah, it's pretty slow. If raw, intensive processing speed is what you are after, Perl 6 is not there yet. (It's getting better and is still in development, but...) It's great for rapid, proof of concept stuff though, and is often "good enough". --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 11:59, 26 May 2019 (UTC) |
|||