Number theory: primes, arithmetic functions, modular computations, special sequences
-
Updated
Jun 7, 2026 - Haskell
Number theory: primes, arithmetic functions, modular computations, special sequences
A custom prime algorithm, implementation, and performance code & review
Rust code and command-line utility to compute and visualize prime sequences
Prime number sieve written in Rust. Supports multithreading
An attempt to optimise the search for prime.
Parallel FPGA architecture for prime number discovery based on the Cyclic Prime Emergence Algorithm, featuring O(1) per-step primality check without memory.
Searches Prime Numbers, but weeds out all even numbers, since they're not prime. Hence: Optimized. :)
Add a description, image, and links to the prime-search topic page so that developers can more easily learn about it.
To associate your repository with the prime-search topic, visit your repo's landing page and select "manage topics."