Search results

259 packages found

module with functions relating to the prime factors of a positive integer

published version 1.3.3, 5 years ago3 dependents licensed under $MIT
9,383

Miller Rabin algorithm for primality test

published version 4.0.1, 7 years ago338 dependents licensed under $MIT
41,042,662

get prime factors of a number

published version 0.1.0, 8 years ago1 dependents licensed under $ISC
11

Find prime factors.

published version 1.0.3, a year ago0 dependents licensed under $MIT
11

Quickly get a number's prime factors, using a cached Sieve of Eratosthenes

published version 1.1.0, 4 years ago2 dependents licensed under $ISC
20

Arbitrary precision modular arithmetic, cryptographically secure random numbers and strong probable prime generation/testing. It works in modern browsers, Angular, React, Node.js, etc. since it uses the native JS implementation of BigInt

published version 3.3.0, a year ago40 dependents licensed under $MIT
400,903

Do math on arrays: find divisors or factors of a number, sum or multiply an array, and much more!

published version 1.1.3, 10 years ago0 dependents
23

Beta prime distribution cumulative distribution function (CDF).

published version 0.2.2, 4 months ago5 dependents licensed under $Apache-2.0
125,156

elliptic curves implementations in wasm

published version 0.2.2, a year ago10 dependents licensed under $GPL-3.0
77,564

find prime factors of a number

published version 0.0.3, 11 years ago0 dependents licensed under $MIT
8

Assorted common math functions & utilities

published version 5.11.13, 13 days ago49 dependents licensed under $Apache-2.0
36,892

Beta prime distributed pseudorandom numbers.

published version 0.2.1, 9 months ago7 dependents licensed under $Apache-2.0
12,373

Minimal implementation of older cryptography algorithms: RSA, DSA, DH

published version 0.1.0, 5 months ago1 dependents licensed under $MIT
6,864

Tools used to understand or work with numbers in Node.JS, Javascript and derivatives.

published version 1.4.6, 2 years ago1 dependents licensed under $custom
326

Generate a Sieve of Eratosthenes with constant time lookup

published version 1.0.3, 6 years ago1 dependents licensed under $ISC
5,510

Generate a cryptographically-random probable prime number that passes the Miller-Rabin test with the given number of bits of entropy.

published version 1.0.0, a year ago2 dependents
4,110

Test if a number is prime in constant time, using a cached Sieve of Eratosthenes.

published version 1.0.7, 9 years ago2 dependents licensed under $ISC
5,501

Sieve of Eratosthenes implementation.

published version 0.0.3, 6 years ago2 dependents licensed under $MIT
5,533

Checks if a number is prime, and if not, returns the corresponding factors. Used for PhoneGap Day EU 2017 'Creating Modern PhoneGap Plugins' workshop; not intended for production use (there are better ways to find primes!)

published version 1.0.1, 8 years ago0 dependents licensed under $MIT
16

Implementation of the Miller-Rabin primality test.

published version 1.0.0, a year ago2 dependents
3,885