๐งฉ Can Modulus 9 Appear Exactly Twice in an Odd Covering System?
A computer-assisted mathematical proof rules out an entire finite covering-system class. ๐ข A surprisingly specific question In number theory, a covering system is a finite collection of congruences whose residue classes together cover every integer. Here, the modulus is the repeating step size of a congruence class. For example, each congruence has the form x == a_i (mod m_i) Now impose three conditions: every modulus is odd and greater than 1 ; modulus 9 appears exactly twice; every other modulus appears at most once. A natural question is: Can such a covering system exist? The answer is: No. That is the central result of Shunyaya Residual Capacity Theory (SRCT) , presented as a computer-assisted mathematical proof . The theorem is class-wide: it does not eliminate a few examples or a bounded search region. It rules out every finite covering system satisfying those exact conditions . ๐ Explore the complete SRCT repository on GitHub ๐งฉ Why modulus 9 matters A standard quantity ...