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 00:00, 24 May 2019
, 4 years ago→Space compression and proof ?
Thundergnat (talk | contribs) (→Space compression and proof ?: tentative smallest for base 17) |
|||
Line 168:
Base 17: 423F82GA9² == 101246A89CGFB357ED
:::So digital root 9, I think, drawn from the dual-symmetry base 17 cycle for perfect squares of
::: <pre> [ '1', 'g', '1', '4', '9', 'g', '9', '4', '1', 'g', '1']</pre>
::: base 13 (digital root 1 for the first match), also has a dual-symmetry cycle.
::: Conceivable that there is some congruence there ?:
<pre>
# '1', 'g', '1', '4', '9', 'g', '9', '4', '1', 'g', '1' base 17 (digital root 9 for that candidate)
# * *
# '4', '9', '4', '1', 'c', '1', '4', '9', '4' base 13 (digital root 1 for the first match found)</pre>
::: [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 23:59, 23 May 2019 (UTC)
| |||