Number theory: primes, arithmetic functions, modular computations, special sequences
Beginner level projects in Python
Tool for Solving Problems in Combinatorics and Computational Mathematics
This repository is all about various concepts related to number theory algorithms. It also contains solutions to problems from various online judges, organized by topic.
Free WordPress Plugin: Quickly find the prime factors of any number with our Prime Factorization Calculator. Instantly generate visual factor trees and view all complete factors. www.calculator.io/prime-factorization-calculator/
R Package for Factoring Big Integers using the C Library GMP (GNU Multiple Precision Arithmetic)
Methods and extensions for prime number detection and discovery.
Prime number library for Python 3
A collection of Integer factorization algorithms
A short code to crack Experimental ElGamal cryptosystem and Rabin’s method.
Taxicab numbers, upper bounds up to BTa(23), their decomposition x³ + y³ (and prime factor decomposition)
but what 'bout B-For Math ?
This is an Android app that I made to help me learn Java and Android application development. I have been continually adding new features and improving old ones as I get new ideas.
This project implements the Rabin Cryptosystem in SageMath, a public-key encryption algorithm based on the integer factorization problem. The system uses blum primes for p and q to simplify the decryption process.
Prime search Application for Windows
Prime numbers up to Integer.MAX_VALUE for Java
Rust library for Combinatorics, Modular Arithemetics & Number Theory utilities.
A list of practical projects that anyone can solve in any programming language. These projects are divided in multiple categories.
To associate your repository with the prime-factorizations topic, visit your repo's landing page and select "manage topics."