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

A Java math library focused on number theory and integer factorization in particular.

This is the repository which contains all Data Structures completely developed in C++

Functions in Python doing prime stuff.

An attempt to optimise the search for prime.

A prime number generator using the sieve of Eratosthenes.

Lazy Sieve of Eratosthenes for infinitely generating primes lazily in Rust.

Quick and Dirty Prime Sieve

Prime number sieve written in Rust. Supports multithreading

prime place for scripts of primes

Mapping the Quantum Way across Prime Identity

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3937

Code to Questions

A sieve of Eratosthenes implemented in x86-64 assembly

Sieve of Eratosthenes and Sieve of Atkin implemented in Python, and made fast using Numba and Numpy.

A somewhat fast C++ implementation of a prime sieve.

Prime sieve impementation.

Prime sieve in assembly

A Go project I undertook without tutorial, to further teach myself, and put into practice the basics of the language.

My solutions to some Project Euler problems. Emphasis on elegance (where possible) and performance.