2018-09-30 22:01:58 +00:00
---
id: 5900f4531000cf542c50ff65
title: 'Problem 230: Fibonacci Words'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 301874
2021-01-13 02:31:00 +00:00
dashedName: problem-230-fibonacci-words
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2021-07-15 12:26:34 +00:00
For any two strings of digits, $A$ and $B$, we define $F_{A,B}$ to be the sequence ($A, B, AB, BAB, ABBAB, \ldots$) in which each term is the concatenation of the previous two.
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
Further, we define $D_{A,B}(n)$ to be the $n^{\text{th}}$ digit in the first term of $F_{A,B}$ that contains at least $n$ digits.
2018-09-30 22:01:58 +00:00
Example:
2021-07-15 12:26:34 +00:00
Let $A = 1\\,415\\,926\\,535$, $B = 8\\,979\\,323\\,846$. We wish to find $D_{A,B}(35)$, say.
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
The first few terms of $F_{A,B}$ are:
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
$$\begin{align}
& 1\\,415\\,926\\,535 \\\\
& 8\\,979\\,323\\,846 \\\\
& 14\\,159\\,265\\,358\\,979\\,323\\,846 \\\\
& 897\\,932\\,384\\,614\\,159\\,265\\,358\\,979\\,323\\,846 \\\\
& 14\\,159\\,265\\,358\\,979\\,323\\,846\\,897\\,932\\,384\\,614\\,15\color{red}{9}\\,265\\,358\\,979\\,323\\,846
\end{align}$$
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
Then $D_{A,B}(35)$ is the ${35}^{\text{th}}$ digit in the fifth term, which is 9.
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
Now we use for $A$ the first 100 digits of $π$ behind the decimal point:
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
$$\begin{align}
& 14\\,159\\,265\\,358\\,979\\,323\\,846\\,264\\,338\\,327\\,950\\,288\\,419\\,716\\,939\\,937\\,510 \\\\
& 58\\,209\\,749\\,445\\,923\\,078\\,164\\,062\\,862\\,089\\,986\\,280\\,348\\,253\\,421\\,170\\,679
\end{align}$$
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
and for $B$ the next hundred digits:
$$\begin{align}
& 82\\,148\\,086\\,513\\,282\\,306\\,647\\,093\\,844\\,609\\,550\\,582\\,231\\,725\\,359\\,408\\,128 \\\\
& 48\\,111\\,745\\,028\\,410\\,270\\,193\\,852\\,110\\,555\\,964\\,462\\,294\\,895\\,493\\,038\\,196
\end{align}$$
Find $\sum_{n = 0, 1, \ldots, 17} {10}^n × D_{A,B}((127 + 19n) × 7^n)$.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
`fibonacciWords()` should return `850481152593119200` .
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
2021-07-15 12:26:34 +00:00
assert.strictEqual(fibonacciWords(), 850481152593119200);
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
# --seed--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
## --seed-contents--
2018-09-30 22:01:58 +00:00
```js
2021-07-15 12:26:34 +00:00
function fibonacciWords() {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return true;
}
2021-07-15 12:26:34 +00:00
fibonacciWords();
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
// solution required
```