my-prime

Prime finder

An algorithm implementation for finding prime numbers

Finds prime numbers using the Sieve of Eratosthenes algorithm.

GitHub

2 stars
2 watching
0 forks
Language: JavaScript
last commit: over 2 years ago
Linked from 1 awesome list

nodejsnpmnpm-packagenumber-theoryopensourceprime-numbers

Backlinks from these awesome lists:

Related projects:

Repository Description Stars
jkthorne/prime A basic implementation of a prime number generator in Crystal language 1
jzakiya/primes-utils A Ruby gem providing utility methods for testing and generating primes. 3
paulmillr/array.prototype.findindex Polyfills ES6 Array.prototype.findIndex for older environments 28
paulmillr/array.prototype.find Fills ES6 Array.prototype.find method in older environments 38
kristofferc/nearestneighbors.jl A Julia package for efficient nearest neighbor searches in high-dimensional spaces 426
patrick9313/sudoku A MATLAB program using an heuristic search algorithm to solve specific Sudoku puzzles 30
johnwquarles/mirrarray Creates an object mapping input values to their string representations as keys. 5
pmerienne/trident-ml A real-time online machine learning library built on top of Storm and Trident. 381
sindresorhus/npm-user Extracts user data from an npm user's profile page 57
jzakiya/roots A gem providing methods to compute exact integer roots of real values for arbitrary sized integers. 1
sindresorhus/npm-keyword A utility for fetching metadata about npm packages based on specific keywords 52
moskomule/eve.pytorch An implementation of an optimization algorithm inspired by a 2016 research paper 33
mebeim/aoc A personal repository of Advent of Code puzzle solutions and walkthroughs. 386
petitparser/dart-petitparser A dynamic parser combinator library for Dart. 460
tonyday567/numhask A Haskell numeric prelude providing a structured approach to numbers and operations. 68