Let an count length-n strings over {0,1,2} with no substring 20. Derive a recurrence and calculate a5.
Quant ResearchLevel: AdvancedPattern-avoiding recurrence
Let a_n count length-n strings over {0,1,2} with no substring 20. Derive a recurrence and calculate a_5.
Hints
- Count all extensions, then subtract newly forbidden ones.
- The forbidden pair can only be created at the new end.
Answer
This answer is part of mentoring
Advanced questions come with a full breakdown and a mock interview with a working quant researcher. The first call is free.
Source and licence: Oscar Levin — Discrete Mathematics: An Open Introduction, 3rd edition · CC-BY-SA-4.0 · answer: Quantoros editorial