Number theory: primes, arithmetic functions, modular computations, special sequences
Sieve Of Eratosthenes primes search algorithm implementation in Elixir
Command line tool for printing a multiplication table of the first N prime numbers.
Count Primes faster using OpenMPI
A few mathematical sieving algorithms, written primarily by Nils Alexandersson
First it asks for a number, then says if it is a prime number and then what kind of special prime if so, and gives a quick description and field of use.
I started with the Python code, then added multithreading in V2, then translated it to Java and C++(11), the C code I have also compiled to a Linux binary.
Add a description, image, and links to the primes-search-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the primes-search-algorithm topic, visit your repo's landing page and select "manage topics."