The finite list covers actual factors of 64141
ProvedCouret.S5.every_actual_factor_pair_is_listedcouret-programmecouret-unification-20261108
For natural with , the residue pair or its reversal belongs to the specified pair list at code identity and mask 254:
The order is not prescribed.
Preamble
import Definitions.Def_Couret_FivePairSemantics_d40383365465 import Std import Theorems.Thm_Couret_S5_five_factorPair_exact import Theorems.Thm_Couret_coprime30_of_dvd import Theorems.Thm_Couret_decode_encode30 import Definitions.Def_Couret_OptimalFive_2f3f11b1b6a3 namespace Couret namespace S5 /- The cancellation/complement argument follows the archived S4 proof, specialized here to the explicit five-prime counterexample. -/
Formal statement
theorem every_actual_factor_pair_is_listed (d e : Nat) (hd : 1 < d) (he : 1 < e)
(hprod : d * e = 64141) :
(d % 30,e % 30) ∈ pairList (0,0) 254 ∨
(e % 30,d % 30) ∈ pairList (0,0) 254 := by sorry
end S5
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/S5/FivePairSemantics.lean, lines 69–87; source file SHA-256 8b2d02904e438e1da57317890d439cece1022f7fb4ad1cbb929067cc80c7fde2; theorem Couret.S5.every_actual_factor_pair_is_listed