Pocklington divisor property
ProvedLL_Decomp126b.pocklington_divisorsnumber-theory
Let with , and , and let satisfy and for every prime , where is natural-number division. Then every divisor of has the form for some natural number .
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_Decomp126bSource
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 be natural numbers with , , and . Let be an integer with . Assume that for every prime dividing , , where is exact division because .
Conclusion: for every natural number with and , there is a natural number with and .
Notes: is not assumed prime. The clause follows from . The integer may be negative. Nothing is vacuous: , , , satisfies every hypothesis, and .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.