Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The finite list covers actual factors of 64141

Proved
Couret.S5.every_actual_factor_pair_is_listed

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

For natural d,e>1d,e>1d,e>1 with de=64141de=64141de=64141, the residue pair (d mod 30,e mod 30)(d\bmod30,e\bmod30)(dmod30,emod30) or its reversal belongs to the specified pair list at code identity and mask 254:

((d mod 30),(e mod 30))∈L or ((e mod 30),(d mod 30))∈L.((d\bmod30),(e\bmod30))\in L\ \text{or}\ ((e\bmod30),(d\bmod30))\in L.((dmod30),(emod30))∈L or ((emod30),(dmod30))∈L.

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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me