Author |
Topic: number strings and sub-strings (Read 442 times) |
|
Brian
Guest
|
consider all m-digit strings made of n different numbers. for example, with (m,n)=(2,3), they are: 11 21 31 12 22 32 13 23 33 note that there are always n^m different strings. now consider a longer string containing these m digits. the minimum size it has to be to be able to contain all the m-digit substrings would be n^m + n - 1. for example, with (m,n)=(2,3) again, one possible string would be 1121322331. is it always possible to construct such a string with this minimum length?
|
|
IP Logged |
|
|
|
brian
Guest
|
|
Re: number strings and sub-strings
« Reply #2 on: Aug 27th, 2004, 9:34am » |
Quote Modify
Remove
|
o sorry. but i didnt see a clear proof of the general case over there, so do you or anyone else have that?
|
|
IP Logged |
|
|
|
|