Name: Anonymous 2010-07-25 5:00
I recently encountered the following problem: How long is the shortest possible string in a given alphabet of size N, that contains all n-symbol strings? And how to construct such a sequence.
For instance, say, an electronic lock will open when a certain unknown 4-digit code is entered at any time. (N = 10, n = 4) What's the minimum number of keypresses that will open the lock with 100% certainty?
For instance, say, an electronic lock will open when a certain unknown 4-digit code is entered at any time. (N = 10, n = 4) What's the minimum number of keypresses that will open the lock with 100% certainty?