Skip to content

Commit

Permalink
Add an algorithm to find Taylor series approximation of exponential f… (
Browse files Browse the repository at this point in the history
  • Loading branch information
prashalruchiranga authored Oct 20, 2022
1 parent 5867186 commit 73bf91d
Show file tree
Hide file tree
Showing 2 changed files with 41 additions and 0 deletions.
25 changes: 25 additions & 0 deletions Maths/ExponentialFunction.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
/**
* @function exponentialFunction
* @description Calculates the n+1 th order Taylor series approximation of exponential function e^x given n
* @param {Integer} power
* @param {Integer} order - 1
* @returns exponentialFunction(2,20) = 7.3890560989301735
* @url https://en.wikipedia.org/wiki/Exponential_function
*/
function exponentialFunction (power, n) {
let output = 0
let fac = 1
if (isNaN(power) || isNaN(n) || n < 0) {
throw new TypeError('Invalid Input')
}
if (n === 0) { return 1 }
for (let i = 0; i < n; i++) {
output += (power ** i) / fac
fac *= (i + 1)
}
return output
}

export {
exponentialFunction
}
16 changes: 16 additions & 0 deletions Maths/test/ExponentialFunction.test.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
import { exponentialFunction } from '../ExponentialFunction'

describe('Tests for exponential function', () => {
it('should be a function', () => {
expect(typeof exponentialFunction).toEqual('function')
})

it('should throw error for invalid input', () => {
expect(() => exponentialFunction(2, -34)).toThrow()
})

it('should return the exponential function of power of 5 and order of 21', () => {
const ex = exponentialFunction(5, 20)
expect(ex).toBe(148.4131078683383)
})
})

0 comments on commit 73bf91d

Please sign in to comment.