Popular repositories Loading

1. Linear-Diophantine-Representation-Systems-p-1-mod-q- Linear-Diophantine-Representation-Systems-p-1-mod-q- Public

   A complete theory of linear Diophantine systems N = pA + qB with p ≡ 1 (mod q). The minimal A-value always equals the digital root of N. Includes Additivity Theory, Matryoshka Theory, and proof tha…

   Python 3

2. the-exact-algebraic-condition-for-clock-behaviour. the-exact-algebraic-condition-for-clock-behaviour. Public

   This paper analyses the linear Diophantine system N = 25A + 12B, where p ≡ 1 (mod q) — the exact algebraic condition for clock behaviour.

   3

3. MRS-Hybride-PQC MRS-Hybride-PQC Public

   Hybrid Post-Quantum cryptographic library: Kyber1024 KEM + MRS(19,9) Diophantine key derivation + AES-256-GCM encryption.

   Rust 2

4. The-A-C-Coupling-Theorem-N-pA-qB-rC The-A-C-Coupling-Theorem-N-pA-qB-rC Public

   N = pA + qB + rC, with N non-negative integer, coëfficiënt p, q, r positive integers, variables A, B, C non-negative integers.

   1

5. D3-by-A-C-Coupling-Demo D3-by-A-C-Coupling-Demo Public

   This demo validates the D³ pattern on the Euro currency system. For any amount N, it computes the control value A₀ = N mod 9 = dr(N), the optimal greedy decomposition across 5 structural layers wit…

   HTML

6. p-mod-q-calculator p-mod-q-calculator Public

   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 larg…

   HTML