Find the smallest positive base 10 integer, for each of (a) through (d), (but with a 3digit minimum), such that moving a digit is equivalent to changing the base from 10 to some other base which you must determine, according to one specific condition below:
(a) Moving a 6 from last digit to first changes from base 10 to a smaller base
(b) Moving a 3 from first digit to last changes from base 10 to a smaller base
(c) Moving a 2 from last digit to first changes from base 10 to a larger base
(d) Moving an 8 from first digit to last changes from base 10 to a larger base
Note: The new base may be different for each of (a) to (d)
(In reply to
re(2): computer exploration by Charlie)
"(but with a 3digit minimum)"
There's one with 3 digits

Posted by Larry
on 20220419 16:38:16 