Short explanations and implementations of different algorithms in multiple languages

Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python

Poor man's big integer arithmetic operations

Chebyshev polynomials of the first kind and primality testing

Miller–Rabin primality test in Lean

EPR: A Factoring and Primality checking library for C++

Extra contribution for mathcomp

A simple prime number library (in Prolog)

A toy RSA implementation in C using Accelerate.framework

Stable operators of fall.

Prime factorization up to 128 bit integers

A prime factorization calculator for the web.

Functions implementation related to prime numbers in python language

An optimized Lucas-Lehmer primality test

primality test (Miller Rabin) implement by c#, transplantation from https://github.com/coapp-packages/mpir

From basic algorithms like Sieve, Bitwise-sieve, Segmnted-sieve, Modular Arithmetic, Big Mod to Primality test, CRT etc. all other advance number theory algorithms.

Implementation of popular algorithms and data structures using .NET Core

School project: Primality test algorithm using Assembly 8086

Miller-Rabin probabilistic primality test.

A series of programs that enable one's investigations in the algebraic complexity theory such as matrix multiplication algorithms, primality tests, algebraic complexity, sorting algorithms etc. Each algorithm is accompanied by a comparative time complexity analysis and a class of test cases and test suites.