I think one of Éric's examples made it clear that the procedure abducts the rightmost occurrence of the smallest digit and turns it into an exponent. I am curious to know how Edwin proved the completeness of his reduced looper set. I mean, how do you know there isn't some biggish number that gets squared or cubed a few times, until it's really gigantic, and then happens to be made mostly of 1's, which when removed leave the original biggish number? On Tue, Dec 29, 2020 at 11:49 PM Dan Asimov <asimov@msri.org> wrote:
Eric Angélini a écrit:
Starting from the right, pick D’s smallest digit
What does *where you start* have to do with this?
And what is the rule for when there is a tie?
(52792, for instance.)
—Dan
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun