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 4 years ago
Linked from 1 awesome list

nodejsnpmnpm-packagenumber-theoryopensourceprime-numbers

Backlinks from these awesome lists:

Related projects:

RepositoryDescriptionStars
jkthorne/primeA basic implementation of a prime number generator in Crystal language1
jzakiya/primes-utilsA Ruby gem providing utility methods for testing and generating primes.3
paulmillr/array.prototype.findindexPolyfills ES6 Array.prototype.findIndex for older environments28
paulmillr/array.prototype.findFills ES6 Array.prototype.find method in older environments38
kristofferc/nearestneighbors.jlA Julia package for efficient nearest neighbor searches in high-dimensional spaces426
patrick9313/sudokuA MATLAB program using an heuristic search algorithm to solve specific Sudoku puzzles28
johnwquarles/mirrarrayCreates an object mapping input values to their string representations as keys.5
pmerienne/trident-mlA real-time online machine learning library built on top of Storm and Trident.381
sindresorhus/npm-userExtracts user data from an npm user's profile page57
jzakiya/rootsA gem providing methods to compute exact integer roots of real values for arbitrary sized integers.1
sindresorhus/npm-keywordA utility for fetching metadata about npm packages based on specific keywords52
moskomule/eve.pytorchAn implementation of an optimization algorithm inspired by a 2016 research paper33
mebeim/aocA personal repository of Advent of Code solutions and walkthroughs.403
petitparser/dart-petitparserA dynamic parser combinator library for Dart.460
tonyday567/numhaskA Haskell numeric prelude providing a structured approach to numbers and operations.69