Short explanations and implementations of different algorithms in multiple languages
Computer Algebra and Symbolic Computation System for Combinatorics and Algebraic Number Theory for JavaScript
Poor man's big integer arithmetic operations
EPR: A Factoring and Primality checking library for C++
Miller–Rabin primality test in Lean
Chebyshev polynomials of the first kind and primality testing
A simple prime number library (in Prolog)
Prime factorization up to 128 bit integers
Extra contribution for mathcomp
A toy RSA implementation in C using Accelerate.framework
Stable operators of fall.
Implementation of popular algorithms and data structures using .NET Core
From basic algorithms like Sieve, Bitwise-sieve, Segmnted-sieve, Modular Arithmetic, Big Mod to Primality test, CRT etc. all other advance number theory algorithms.
Functions implementation related to prime numbers in python language
Ultra-Fast O(L) Deterministic Primality Testing — Multi-Architectural Pass Engine (MAPE-V3) Deterministic multi-layer prime testing for giant numbers using single-pass linear mod engines (Muamer Engine).
primality test (Miller Rabin) implement by c#, transplantation from https://github.com/coapp-packages/mpir
The minimal elements of the prime numbers which are > b written in the positional numeral system with radix b, as digit strings under the subsequence ordering, for 2 ≤ b ≤ 36
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.
Applied Fermat's therory for a primality test for school (freshman year)
Add a description, image, and links to the primality-test topic page so that developers can more easily learn about it.
To associate your repository with the primality-test topic, visit your repo's landing page and select "manage topics."