Author: Jari Huikari
Date: 13:11:22 02/08/00
Go up one level in this thread
On February 08, 2000 at 10:57:44, Andrew Dados wrote: >Below are string lengths for 0.95 chance of finding at least one match for >substring lengths 1-10: (above formula run in Mathematica): > >28.4332 >299.073 >2996.23 >29958.8 >299576. >2.99574 10^6 >2.99573 10^7 >2.99573 10^8 >2.99573 10^9 >2.99573 10^10 > >Looks like 3*10^n is a good approximation of our formula. Yes. I found the first two without coffee. :-) Jari
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.