Search results
266 packages found
Create a readable stream for generating pseudorandom numbers drawn from a beta prime distribution.
This adapter integrates with system described as: cisco prime
A typescript implementation of the Linear-Sieve algorithm for prime numbers.
Minimal implementation of older cryptography algorithms: RSA, DSA, DH
O(1) Algorithm to check if number is not prime that works in 95%+ cases.
Lucas-Lehmer primality test
integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test
Cast Streaming service videos to Chromecast
PrimeReact implementation for Reactive Forms
Takes the stats TSV string copied from Ingress Prime and converts it to JSON. Can handle tabs replaced by spaces, throws an exception if an unknown key is found.
Low memory-usage implementation of a Sieve of Eratosthenes.
UI kit library Elentra
check given number is prime or not
Prime Icons components for Vue. Designed for ease of use and high performance
a npm package for efficiently validating prime integer numbers
Check if a number is prime or not
A customized react table with add on functionalities
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
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
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