Simple algorithm that checks if a number is prime or composite, built using basic principles of Java OOP.

A mirror of the GitLab repo at

In this project we plan on parallelizing the Sieve of Eratosthenes, which is an algorithm for finding prime numbers.

This example finds prime numbers in the Kotlin. 👀 3️⃣ 5️⃣

A very fast async parallel generator for big/large prime numbers. Several prime numbers can be generated simultaneously via the bit or digit length.

Fastest algorithm to check or generate prime numbers.

Analysis notebook on prime numbers

calculate and display prime numbers with fast execution time for given input number range.

Python cli script for counting prime numbers

A learning project that implements an algorithm for finding prime numbers, in several widely-used programming languages, running natively or as containers in multiple environments.

Sample code and project to calculate or check the prime numbers.

A Rust implementation of the Miller-Rabin primality test algorithm.