Finished De Bruijn sections
This commit is contained in:
@ -41,14 +41,13 @@ Consider the same lock, now set with a three-digit binary code.
|
||||
How about a four-digit code? How many digits do we need? \par
|
||||
|
||||
\begin{instructornote}
|
||||
Don't spend too long on this problem.
|
||||
Don't spend too much time here.
|
||||
Provide a solution at the board once everyone has had a few
|
||||
minutes to think about this.
|
||||
minutes to think about this problem.
|
||||
\end{instructornote}
|
||||
|
||||
\begin{solution}
|
||||
Interestingly enough, we can only save one digit. \par
|
||||
Any optimal sequence has 15 digits, for example \texttt{0000111101100101000}
|
||||
One example is \texttt{0000 1111 0110 0101 000}
|
||||
\end{solution}
|
||||
|
||||
\vfill
|
||||
|
Reference in New Issue
Block a user