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: computer exploration by Larry)
Ah, yes. Left out the 80:89 from
for i=[80:89 800:899 8000:8999 80000:89999]
86 decimal is 68 in base 13

Posted by Charlie
on 20220419 13:46:52 