45 lines
995 B
Markdown
45 lines
995 B
Markdown
|
---
|
|||
|
id: 5900f3d51000cf542c50fee6
|
|||
|
title: 'Problem 104: Pandigital Fibonacci ends'
|
|||
|
challengeType: 5
|
|||
|
forumTopicId: 301728
|
|||
|
dashedName: problem-104-pandigital-fibonacci-ends
|
|||
|
---
|
|||
|
|
|||
|
# --description--
|
|||
|
|
|||
|
The Fibonacci sequence is defined by the recurrence relation:
|
|||
|
|
|||
|
Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
|
|||
|
|
|||
|
It turns out that F541, which contains 113 digits, is the first Fibonacci number for which the last nine digits are 1-9 pandigital (contain all the digits 1 to 9, but not necessarily in order). And F2749, which contains 575 digits, is the first Fibonacci number for which the first nine digits are 1-9 pandigital.
|
|||
|
|
|||
|
Given that Fk is the first Fibonacci number for which the first nine digits AND the last nine digits are 1-9 pandigital, find k.
|
|||
|
|
|||
|
# --hints--
|
|||
|
|
|||
|
`euler104()` should return 329468.
|
|||
|
|
|||
|
```js
|
|||
|
assert.strictEqual(euler104(), 329468);
|
|||
|
```
|
|||
|
|
|||
|
# --seed--
|
|||
|
|
|||
|
## --seed-contents--
|
|||
|
|
|||
|
```js
|
|||
|
function euler104() {
|
|||
|
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler104();
|
|||
|
```
|
|||
|
|
|||
|
# --solutions--
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|