English: One possible de Bruijn sequence for a substring length, n of 4 and an alphabet size, k of 10, by CMG Lee. The 2530 substrings are read from top to bottom then left to right, and their digits are concatenated. To get the string to brute-force a combination lock, the last three digits in brackets (000) are appended. The 10003-digit string is hence "0 0001 0002 0003 0004 0005 0006 0007 0008 0009 0011...79 7988 7989 7998 7999 8 8889 8899 89 8999 9 000" (spaces added for readability).
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue
You may select the license of your choice.
Captions
Add a one-line explanation of what this file represents
{{Information |Description ={{en|1=One possible de Bruijn sequence for a substring length, n of 4 and an alphabet size, k of 10, by CMG Lee. The 2530 substrings are read from top to bottom then left to right, and their digits are concatenated. To ge...
This file contains additional information, probably added from the digital camera or scanner used to create or digitize it.
If the file has been modified from its original state, some details may not fully reflect the modified file.
Short title
de Bruijn sequence 10 4
Image title
One possible de Bruijn sequence for a substring length, n of 4 and an alphabet size, k of 10, by CMG Lee. The 2530 substrings are read from top to bottom then left to right, and their digits are concatenated. To get the string to brute-force a combination lock, the last three digits in brackets (000) are appended. The 10003-digit string is hence "0 0001 0002 0003 0004 0005 0006 0007 0008 0009 0011...79 7988 7989 7998 7999 8 8889 8899 89 8999 9 000" (spaces added for readability).