npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

math-lib

v0.1.7

Published

Math library that contains functions for prime number computations, root finding using Newton Raphson, first and second derivative computations

Downloads

36

Readme

How to use the library

var ml = require('math-lib');
console.log(ml().numberHelper().checkPrime(7));

Function listing

checkPrime(input)

Checks if the input number is a prime number or not. Input number should be a positive integer.

var nh = require('math-lib');
console.log(ml().numberHelper().checkPrime(7)); // returns true
console.log(ml().numberHelper().checkPrime(25)); // returns true
console.log(ml().numberHelper().checkPrime(-25)); // returns Error
console.log(ml().numberHelper().checkPrime(25.7)); // returns Error

getFibonacciSeries(a0, a1, numberRequired)

Generates an array of Fibonacci Series that includes a0 and a1, which are passed as parameters.

var nh = require('math-lib');
console.log(ml().numberHelper().getFibonacciSeries(0, 1, 10)); // returns [ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 ];

getFibonacciSeriesUpto(a0, a1, upperLimit)

Generates an array of Fibonacci Series upto a user specified upper limit.

var nh = require('math-lib');
console.log(ml().numberHelper().getFibonacciSeriesUpto(0, 1, 10)); // returns [ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 ];

listPrimeNumbersUpto(input)

Generates a list all prime numbers up to a given input. Implements Sieve of Eratosthenes.

var nh = require('math-lib');
console.log(ml().numberHelper().listPrimeNumbersUpto(10)); // returns [ 2, 3, 5, 7 ]

getPrimeFactors(input)

Generates a list all prime factors of a given input.

var nh = require('math-lib');
console.log(ml().numberHelper().getPrimeFactors(600851475143)); // returns [ 71, 839, 1471, 6857 ]

computeSlope(foo, x)

Computes the first derivative (slope) of a function foo at x. Central difference method is used to compute the first derivative. Methodology used to compute the first derivative and the choice of step size is detailed here: https://en.wikipedia.org/wiki/Numerical_differentiation User has to ensure that the function foo is differentiable at x.

var nh = require('math-lib');
console.log(ml().numberHelper().computeSlope(function(x) {
  return x * x;
}, 2)); //returns 4.00000000
var foo2 = function(x) {
  return Math.sin(x);
};
console.log(ml().numberHelper().computeSlope(foo2, Math.PI)); // returns -0.99999999

computeSlope(foo, x)

Computes the second derivative of a function foo at x. Central difference method is used to compute the second derivative. Methodology used to compute the second derivative and the choice of step size is detailed here: https://en.wikipedia.org/wiki/Second_derivative User has to ensure that the function foo is differentiable twice at x.

console.log('foo1', ml().numberHelper().computeSecondDerivative(function(x) {
  return x * x;
}, 2)); // returns 1.999999

newtonRaphson(foo, x, numIterations)

Computes the nearest root of function foo using Newton Raphson method. The root finding algorithm begins the search at x and iterates for the root for the number of times as specified by the second parameter - numIterations.

var foo1 = function(x) {
  return x * x - 5 * x + 6;
};

function newtonRaphsonTest() {
  console.log(ml().numberHelper().newtonRaphson(foo1, -100, 100));
} // returns 2

function newtonRaphsonTest() {
  console.log(ml().numberHelper().newtonRaphson(foo1, -100, 100));
} // returns 2.999999

gaussianElimination(input)

Solves a series of simultaneous equtions using Gauss Jordan Elimination. Details of the method can be found here: https://en.wikipedia.org/wiki/Gaussian_elimination

@param {Number[Number[]]} input - A matrix is an array of arrays of numbers. Hence, the input is an array of arrays of numbers that describes the augmented matrix which is an input to the method. For example, for equations (2x + 3y = 5) and (7x + 10y = 17), the augmented matrix that is to be passed as an input is as follows: input = [[2, 3, 5], [7, 10, 17]];

@returns {[Number[]} - An array of array of numbers - an array output consisting of the rightmost column of the augmented matrix.

var set1 = [[2, 1, -1, 8],
             [-3, -1, 2, -11],
             [-2, 1, 2, -3]];

var set2  = [[2, 3, 5], [7, 10, 17]];

console.log(ml().matrixHelper().gaussianElimination(set1));
// returns [2, 3, -1]

console.log(ml().matrixHelper().gaussianElimination(set2));
// returns [1, 2]