19 Oct
2015
19 Oct
'15
5:43 p.m.
See https://en.wikipedia.org/wiki/Coupon_collector's_problem WFL On 10/19/15, David Wilson <davidwwilson@comcast.net> wrote:
OEIS A036903(n) gives the number of digits of pi you must scan before seeing every possible n-digit substring.
Over all infinite strings of digits, what is the expected number of digits you must scan before seeing every n-digit substring?
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun