This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.
-
Updated
Nov 23, 2022 - Python
This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.
Repository for the FermulerPy core package. Fermulerpy is useful for problems related to various fields of Number Theory.
Source code for the CORVIDS data reconstruction system
A set of python programs that can be used by early learners of the Mathematical Foundations of Computer Sciences (courtesy: Introduction to the Theory of Computation by Michael Sipser)
# LQG Volume Operator Spectral Analysis
Python3 Garner's algorithm to solve diophantine equations system with coprime moduli
Calculator for the p ≡ 1 (mod q) framework. Computes the number of representations N = pA + qB in strict O(1) time using digital roots (dr) as starting point A0 = N mod q. Supports arbitrarily large numbers via BigInt.
Encryption algorithm based on system of linear diophantine equations resistant to quantum algorithms
iLWN (In Love With Numbers) project repository. Contains source code (all subprojects + website) and documentation.
Gear-train designer for watchmakers: optimal trains for astronomical complications and exact timekeeping
🧮 Solve linear Diophantine equations of the form ax + by = c
To associate your repository with the diophantine topic, visit your repo's landing page and select "manage topics."