Fibonacci String/Examples/S3
Jump to navigation
Jump to search
Example of Fibonacci Strings
The Fibonacci string $S_3$ is $\text{ba}$.
Proof
By definition of Fibonacci string:
\(\ds S_1\) | \(=\) | \(\ds \text{a}\) | ||||||||||||
\(\ds S_2\) | \(=\) | \(\ds \text{b}\) |
Then:
\(\ds S_3\) | \(=\) | \(\ds S_2 S_1\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \text{ba}\) |
$\blacksquare$
Sources
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.8$: Fibonacci Numbers: Exercise $36$