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 02:32, 26 May 2019
, 5 years ago→analytically determine minimum start value: You are right, I am wrong
(Added comment about apparent discrepancy in results for base 21.) |
Thundergnat (talk | contribs) (→analytically determine minimum start value: You are right, I am wrong) |
||
Line 309:
Unless there's something wrong with Go's big.Int routines, both numbers check out as perfect squares when I convert them to decimal so I'm at a loss to explain the difference. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 00:20, 26 May 2019 (UTC)
: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)
==Calculating quadratic residues==
The valid digital roots can be calculated using the following code in F#:
| |||