freeCodeCamp/problem-104-pandigital-fibonacci-ends.english.md at 81a0c0c8e07a6c3a4f99228a8af10967fa0c53d9

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.2 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3d51000cf542c50fee6	5	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

tests:
  - text: <code>euler104()</code> should return 329468.
    testString: assert.strictEqual(euler104(), 329468, '<code>euler104()</code> should return 329468.');

Challenge Seed

function euler104() {
  // Good luck!
  return true;
}

euler104();

Solution

// solution required

1.2 KiB Raw Blame History Unescape Escape