---
id: 5900f3d51000cf542c50fee6
challengeType: 5
title: '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.
## Instructions
## Tests
```yml
tests:
- text: euler104() should return 329468.
testString: assert.strictEqual(euler104(), 329468, 'euler104() should return 329468.');
```
## Challenge Seed
```js
function euler104() {
// Good luck!
return true;
}
euler104();
```