Number theory: primes, arithmetic functions, modular computations, special sequences

Sieve Of Eratosthenes primes search algorithm implementation in Elixir

A fairly fast c based prime calculator. Calculates in parallel & sequentially

Count Primes faster using OpenMPI

Command line tool for printing a multiplication table of the first N prime numbers.

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.