Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pocklington divisor property

Proved
LL_Decomp126b.pocklington_divisors

by sthubbar · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Let N,R,F∈NN,R,F\in\mathbb NN,R,F∈N with N≥2N\ge2N≥2, F≥2F\ge2F≥2 and N=RF+1N=RF+1N=RF+1, and let a∈Za\in\mathbb Za∈Z satisfy aN−1≡1(modN)a^{N-1}\equiv1\pmod NaN−1≡1(modN) and gcd⁡(a(N−1)/p−1,N)=1\gcd(a^{(N-1)/p}-1,N)=1gcd(a(N−1)/p−1,N)=1 for every prime p∣Fp\mid Fp∣F, where (N−1)/p(N-1)/p(N−1)/p is natural-number division. Then every divisor d>1d>1d>1 of NNN has the form d=kF+1d=kF+1d=kF+1 for some natural number k≥1k\ge1k≥1.

Preamble
import Mathlib
Formal statement
namespace LL_Decomp126b
theorem pocklington_divisors {N R F : ℕ} (hN2 : 2 ≤ N) (hF2 : 2 ≤ F)
    (hN : N = R * F + 1) {a : ℤ} (ha : Int.ModEq (N : ℤ) (a ^ (N - 1)) 1)
    (hgcd : ∀ p : ℕ, p.Prime → p ∣ F → Int.gcd (a ^ ((N - 1) / p) - 1) N = 1) :
    ∀ d : ℕ, d ∣ N → 1 < d → ∃ k : ℕ, 0 < k ∧ d = k * F + 1 := by sorry
end LL_Decomp126b
Source
O. Ramaré and Y. Saouter, Short effective intervals containing primes, Journal of Number Theory 98 (2003), 10 to 33. ; Lemma 8 and its proof, p. 27; first sentence of the proof, citing Brillhart, Lehmer and Selfridge
Read-back

What the Lean code literally says, in plain math · claude-haiku

Let N,R,FN, R, FN,R,F be natural numbers with 2≤N2 \le N2≤N, 2≤F2 \le F2≤F, and N=RF+1N = RF + 1N=RF+1. Let aaa be an integer with aN−1≡1(modN)a^{N-1} \equiv 1 \pmod{N}aN−1≡1(modN). Assume that for every prime ppp dividing FFF, gcd⁡(a(N−1)/p−1, N)=1\gcd(a^{(N-1)/p} - 1,\, N) = 1gcd(a(N−1)/p−1,N)=1, where (N−1)/p(N-1)/p(N−1)/p is exact division because p∣F∣N−1p \mid F \mid N-1p∣F∣N−1.

Conclusion: for every natural number ddd with d∣Nd \mid Nd∣N and 1<d1 < d1<d, there is a natural number kkk with 0<k0 < k0<k and d=kF+1d = kF + 1d=kF+1.

Notes: NNN is not assumed prime. The clause 0<k0 < k0<k follows from 1<d1 < d1<d. The integer aaa may be negative. Nothing is vacuous: N=3N = 3N=3, R=1R = 1R=1, F=2F = 2F=2, a=2a = 2a=2 satisfies every hypothesis, and 3=1⋅2+13 = 1 \cdot 2 + 13=1⋅2+1.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

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