79d9012432
* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
59 lines
1.2 KiB
Markdown
59 lines
1.2 KiB
Markdown
---
|
||
id: 5900f3d51000cf542c50fee6
|
||
challengeType: 5
|
||
title: 'Problem 104: Pandigital Fibonacci ends'
|
||
---
|
||
|
||
## Description
|
||
<section id='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.
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id='instructions'>
|
||
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler104()</code> should return 329468.
|
||
testString: assert.strictEqual(euler104(), 329468, '<code>euler104()</code> should return 329468.');
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler104() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler104();
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|