diff --git a/Maths/Fibonacci.js b/Maths/Fibonacci.js
index fc8102ad2c..998c753027 100644
--- a/Maths/Fibonacci.js
+++ b/Maths/Fibonacci.js
@@ -187,9 +187,20 @@ const FibonacciMatrixExpo = (num) => {
return F[0][0] * (isNeg ? (-ONE) ** (num + ONE) : ONE)
}
+/*
+ Resource : https://math.hmc.edu/funfacts/fibonacci-number-formula/
+*/
+
+const sqrt5 = Math.sqrt(5)
+const phi = (1 + sqrt5) / 2
+const psi = (1 - sqrt5) / 2
+
+const FibonacciUsingFormula = n => Math.round((phi ** n - psi ** n) / sqrt5)
+
export { FibonacciDpWithoutRecursion }
export { FibonacciIterative }
export { FibonacciGenerator }
export { FibonacciRecursive }
export { FibonacciRecursiveDP }
export { FibonacciMatrixExpo }
+export { FibonacciUsingFormula }
diff --git a/Maths/test/Fibonacci.test.js b/Maths/test/Fibonacci.test.js
index f3dcb98fe7..f91aef73d2 100644
--- a/Maths/test/Fibonacci.test.js
+++ b/Maths/test/Fibonacci.test.js
@@ -4,7 +4,8 @@ import {
FibonacciIterative,
FibonacciGenerator,
FibonacciRecursive,
- FibonacciMatrixExpo
+ FibonacciMatrixExpo,
+ FibonacciUsingFormula
} from '../Fibonacci'
describe('Fibonacci', () => {
@@ -95,4 +96,11 @@ describe('Fibonacci', () => {
expect(FibonacciMatrixExpo(-5n)).toBe(5n)
expect(FibonacciMatrixExpo(-6n)).toBe(-8n)
})
+ it.each([
+ [0, 0],
+ [1, 1],
+ [15, 610]
+ ])('should calculate the correct Fibonacci number for n = %i', (n, expected) => {
+ expect(FibonacciUsingFormula(n)).toBe(expected)
+ })
})
pFad - Phonifier reborn
Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies:
Alternative Proxy
pFad Proxy
pFad v3 Proxy
pFad v4 Proxy