Talk:First perfect square in base n with n unique digits: Difference between revisions
Talk:First perfect square in base n with n unique digits (view source)
Revision as of 15:42, 26 May 2019
, 4 years ago→analytically determine minimum start value: Added further comment.
m (→any ideas of optimizations ?: check runtime for base 22) |
(→analytically determine minimum start value: Added further comment.) |
||
Line 323:
:Well, I think the simple explanation is that I screwed something up. When I run it again, I get the same thing you got, so I'm not sure where that came from. I must have saved a result from an interim version where I was still working out bugs and never went back and reverified it; which is pretty sad since 21 actually finishes very quickly. At any rate, you are correct, I have the wrong answer for base 21 right now. Fixing. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 02:32, 26 May 2019 (UTC)
I've run it through to base 25 now and found another anomaly at that point where, although we agree on N², we disagree on N where I have 1011E145FHGHM but you have 1011E145FHGI3.
This has certainly been an interesting task which has taught me a lot so thankyou for thinking it up in the first place.
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)
==Calculating quadratic residues==
| |||