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 11:34, 23 May 2019
, 5 years ago→Space compression and proof ?
Line 55:
Not sure whether there is a provably reducible pattern here which might yield some more compression of the search space, but there is a literature on the necessary cyclicality of the repeated digit sums of perfect squares, and if there also turned out to be a pattern to the squared digit sum of *these* particular squares, it might be possible to divide the search space by the length of the digit sum cycle for a given base.
For professional pattern searchers, the output of this problem is adorned for each base below with:
# the repeated digit sum for each root and square,
# a sample of the cycle of repeated digit sums for squares represented in that base (first 20 perfect squares)
| |||