A Rust implementation of the Miller-Rabin primality test algorithm.
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 very fast async parallel generator for big/large prime numbers. Several prime numbers can be generated simultaneously via the bit or digit length.
In this project we plan on parallelizing the Sieve of Eratosthenes, which is an algorithm for finding prime numbers.
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
This example finds prime numbers in the Kotlin. 👀 3️⃣ 5️⃣
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.
Add a description, image, and links to the prime-number-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the prime-number-algorithm topic, visit your repo's landing page and select "manage topics."