my-prime
Prime finder
An algorithm implementation for finding prime numbers
Finds prime numbers using the Sieve of Eratosthenes algorithm.
2 stars
2 watching
0 forks
Language: JavaScript
last commit: over 4 years agoLinked from 1 awesome list
nodejsnpmnpm-packagenumber-theoryopensourceprime-numbers
Related projects:
| Repository | Description | Stars |
|---|---|---|
| A basic implementation of a prime number generator in Crystal language | 1 | |
| A Ruby gem providing utility methods for testing and generating primes. | 3 | |
| Polyfills ES6 Array.prototype.findIndex for older environments | 28 | |
| Fills ES6 Array.prototype.find method in older environments | 38 | |
| A Julia package for efficient nearest neighbor searches in high-dimensional spaces | 426 | |
| A MATLAB program using an heuristic search algorithm to solve specific Sudoku puzzles | 28 | |
| Creates an object mapping input values to their string representations as keys. | 5 | |
| A real-time online machine learning library built on top of Storm and Trident. | 381 | |
| Extracts user data from an npm user's profile page | 57 | |
| A gem providing methods to compute exact integer roots of real values for arbitrary sized integers. | 1 | |
| A utility for fetching metadata about npm packages based on specific keywords | 52 | |
| An implementation of an optimization algorithm inspired by a 2016 research paper | 33 | |
| A personal repository of Advent of Code solutions and walkthroughs. | 403 | |
| A dynamic parser combinator library for Dart. | 460 | |
| A Haskell numeric prelude providing a structured approach to numbers and operations. | 69 |