30 Nov
2011
30 Nov
'11
9:23 a.m.
Great! I've heard that Richard Stong says he can prove an absolute bound of 3 for all bases, but I don't know his idea. Victor On Wed, Nov 30, 2011 at 10:58 AM, Warren Smith <warren.wds@gmail.com> wrote:
actually a more careful look at my nonrigorous argument last post suggests that in radix R, the number of steps needed is only O(logR).
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun