mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
47 lines
949 B
JavaScript
47 lines
949 B
JavaScript
/**
|
||
* Problem 25 - 1000-digit Fibonacci number
|
||
*
|
||
* @see {@link https://projecteuler.net/problem=25}
|
||
*
|
||
* The Fibonacci sequence is defined by the recurrence relation:
|
||
*
|
||
* Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
|
||
*
|
||
* Hence the first 12 terms will be:
|
||
*
|
||
* F1 = 1
|
||
* F2 = 1
|
||
* F3 = 2
|
||
* F4 = 3
|
||
* F5 = 5
|
||
* F6 = 8
|
||
* F7 = 13
|
||
* F8 = 21
|
||
* F9 = 34
|
||
* F10 = 55
|
||
* F11 = 89
|
||
* F12 = 144
|
||
* The 12th term, F12, is the first term to contain three digits.
|
||
|
||
* What is the index of the first term in the Fibonacci sequence to contain 1000 digits?
|
||
*/
|
||
|
||
// brute force method
|
||
|
||
function fibonacciIndex(t = 1000) {
|
||
const digits = 10n ** BigInt(t - 1)
|
||
let fib0 = BigInt(0)
|
||
let fib1 = BigInt(1)
|
||
let index = 1
|
||
while (fib1 < digits) {
|
||
// using this to compare number of digits instead of .toString() significantly improved run time
|
||
const tempfib = fib1
|
||
fib1 = fib1 + fib0
|
||
fib0 = tempfib
|
||
index += 1
|
||
}
|
||
return index
|
||
}
|
||
|
||
export { fibonacciIndex }
|