algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 00:01:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

ESLINT fixes

Browse Source
This commit is contained in:
Abhishek Jain
2020-10-10 18:14:29 +05:30
parent 6df59cde45
commit 10f664d63f
1 changed files with 11 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
Project-Euler/Problem2.js
View File

@ -1,15 +1,17 @@
const SQ5 = 5 ** .5; // Square root of 5
const PHI = (1 + SQ5) / 2; // definition of PHI
const SQ5 = 5 ** 0.5
//Square root of 5
const PHI = (1 + SQ5) / 2
// definition of PHI
//theoretically it should take O(1) constant amount of time as long
// arithmetic calculations are considered to be in constant amount of time.
// arithmetic calculations are considered to be in constant amount of time
function EvenFibonacci(limit) {
const highestIndex = Math.floor(Math.log(limit * SQ5) / Math.log(PHI));
const n = Math.floor(highestIndex / 3);
return ((PHI ** (3 * n + 3) - 1) / (PHI ** 3 - 1)
- ((1 - PHI) ** (3 * n + 3) - 1) / ((1 - PHI) ** 3 - 1)) / SQ5;
const highestIndex = Math.floor(Math.log(limit * SQ5) / Math.log(PHI))
const n = Math.floor(highestIndex / 3)
return ((PHI ** (3 * n + 3) - 1) / (PHI ** 3 - 1) -
((1 - PHI) ** (3 * n + 3) - 1) / ((1 - PHI) ** 3 - 1)) / SQ5
}
console.log(EvenFibonacci(4e6));
// Sum of Even Fibonnaci upto 4 Million
// Sum of Even Fibonnaci upto 4 Million