Find the smallest positive base 10 integer, for each of (a) through (d), (but with a 3-digit 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(4): computer exploration -- c and d finally by Charlie)
for (c): 382 238 11 must be a typo.
I do notice that
283 in base 10 = 238 in base 11
but these both have 2 at the beginning and the last 2 digits are flipped
|
|
Posted by Larry
on 2022-04-20 07:09:45 |
re(5): computer exploration -- c and d finally
