5 Jun
2016
5 Jun
'16
1:05 p.m.
Andy Latto <andy.latto@pobox.com> wrote:
The missing step is showing that the greedy-algorithm candidate doesn't have more digits than the non-greedy one.
As I posted yesterday, there are failures where it has the same number of digits. For instance 338 rather than 266 in base 9, and 35C rather than 29A in bases 13, 14, and 15. But there are failures where there are too many digits, also. For instance 33333333888 rather than 266666666, 336666668, or 346666666 in base 9.