Coprime natural numbers round-trip through the residue code
ProvedCouret.decode_encode30couret-programmecouret-unification-20261108
Write , with residue map taking to , respectively. If and , then
The coprimality condition ensures the remainder belongs to the eight represented units.
Preamble
import Definitions.Def_Couret_ModularDivisorBridge_2d9305253316 import Std import Definitions.Def_Couret_DivisorCompleteness_e4011d047800 /-! COU-87 S2M, 2026-10-30: the exact bridge from natural divisors to the eight-letter modulo-30 automaton. Prime occurrences need not be distinct. No finite 147-state / 101-class table is imported here. -/ universe v namespace Couret namespace Choice end Choice
Formal statement
theorem decode_encode30 (n : Nat) (hn : Nat.gcd n 30 = 1) :
residue30 (encode30 n) = n % 30 := by sorry
end Couret
Source
Alexandre Couret, Certified minimal memory for a divisor-residue presence observable modulo 30, https://zenodo.org/records/23989640; archive Couret_BC_MOD30_Companion_20261105.zip, SHA-256 9bb2678164c63a9e47c192093f5ce9deb1b7b74a1f1c8fecc77f305a408266a2; file source/S4/ModularDivisorBridge.lean, lines 72–77; source file SHA-256 f72e04425efd9d90f42cc1765e52bcd661653cc739601fb88631de6f94f69c41; theorem Couret.decode_encode30