Anonymous user
Talk:Fibonacci word: Difference between revisions
m
no edit summary
No edit summary |
mNo edit summary |
||
Line 10:
In fact, thinking about it, the longest repeating substring has got to be <i>at least</i>
length(fword(n-2)) for all n > 2.
the longest repeated substring of fword(n) <i>is</i> fword(n-2).]
Even expressing in hexidecimal isn't going to help much.
| |||