Author: Ricardo Gibert
Date: 06:35:15 02/08/00
Go up one level in this thread
On February 08, 2000 at 08:05:40, Les Fernandez wrote: >Does anyone know given a string of "x" numbers (ie 237496) how large must a >string of random numbers be so that you can have a 95% chance of finding that >exact string within the larger string of numbers. If there is a way that I can >calculate it please provide info. Keep in mind although the above example >contains 6 numbers it is used only for an example so that I may understand the >concept. I am interested in being able to calculate how long the length of the >longer string needs to be for numbers up to about 60 in length if this is >possible. Thanks > >Les Given a string of "x" digits. Can the leading digits be zero? Examples: 0, 00, 0123, 00123. What about the substring searched for? The definition of a substring admissible by the problem could be different. Usually a valid number does not start with the digit zero unless the number is zero itself. This needs to be clarified.
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.