Generate and work with prime numbers in const contexts
-
Updated
May 31, 2024 - Rust
Generate and work with prime numbers in const contexts
Methods and extensions for prime number detection and discovery.
C-style arbitrary precision calculator
An attempt to optimise the search for prime.
Number theory: primes, arithmetic functions, modular computations, special sequences
Mathematics implementations in Java
Prime Number Projects in C#/C++/Python
Web application to view benchmark reports generated in/for the Primes project.
🚀 Fast prime counting function implementations
🚀 Fast prime number generator
A very fast async parallel generator for big/large prime numbers. Several prime numbers can be generated simultaneously via the bit or digit length.
Interactive visualization of primes in a spiraling pattern.
A simple yet very fast optimized version of the Segmented Sieve Algorithm based on the Sieve of Eratosthene
Generate Euler Shift Primes
Prime generator, used to compare different algorithms for generating prime numbers.
Add a description, image, and links to the primes topic page so that developers can more easily learn about it.
To associate your repository with the primes topic, visit your repo's landing page and select "manage topics."