The 19-9 System

This document “Linear Diophantine Representation System” develops a number-theoretic framework for linear equations of the form N = pA + qB, with a specific focus on the coprime pair (19, 9). The core findings include: - Generalized Digital Root: For N ≥ pq, the minimal non-negative coefficient A₀ is always exactly equal to the digital root of N modulo q. - Closed Formula: It provides a direct mathematical formula to determine exactly how many representations (R) any given number has. - Symmetry and Patterns: Below the Frobenius bound (the threshold above which all numbers have solutions), representability follows a symmetric, predictable block pattern governed by the Palindrome Block Theorem. - Uniqueness of (19, 9): Through a four-tier classification system, the paper proves that the pair (19, 9) is unique in combining a specific structural hierarchy with a direct link to the perfect number 28.