Strict divisors of 64141 realize exactly seven unit residues
ProvedCouret.S5.five_proper_divisor_residuescouret-programmecouret-unification-20261108
Write , with residue map taking to , respectively. For every ,
This is a concrete arithmetic witness whose strict-divisor residue support omits exactly residue one.
Preamble
import Definitions.Def_Couret_OptimalFive_2f3f11b1b6a3 import Std import Theorems.Thm_Couret_maskRun_correct import Theorems.Thm_Couret_mask_254_omits_only_residue_one import Theorems.Thm_Couret_properSupport_mod30_iff_divisor import Definitions.Def_Couret_DavenportThreshold_ac37b2f8de8c set_option maxRecDepth 100000 set_option maxHeartbeats 4000000 namespace Couret namespace S5
Formal statement
theorem five_proper_divisor_residues (u : Code30) :
(∃ d : Nat, d ∣ 64141 ∧ 1 < d ∧ d < 64141 ∧ d % 30 = residue30 u) ↔ residue30 u ≠ 1 := 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/OptimalFive.lean, lines 59–63; source file SHA-256 10e4872f2ae446d57ad6e2c526d92085da7cdb70df9bb99e2641c0da1b7e7c1f; theorem Couret.S5.five_proper_divisor_residues