Sparse reciprocal weights force small prime factors
ProvedPrimePairSieve.sparse_selected_prime_factor_boundfive-primesnumber-theory
Suppose a squarefree index has literal reciprocal sieve weight for a positive integer . Then every prime factor of satisfies .
Preamble
import Mathlib import Definitions.Def_PrimePairSieve_ReciprocalLiteralWeight open scoped BigOperators set_option autoImplicit false
Formal statement
theorem PrimePairSieve.sparse_selected_prime_factor_bound (n p K : ℕ) (hK : 0 < K)
(hselected : (1 : ℝ) / K ≤ PrimePairSieve.reciprocal_literal_weight n)
(hp : p ∈ n.primeFactors) :
p ≤ 4 * K + 2 := by sorrySource
Prove2Me five-primes reciprocal finite-window certificate design note (2026-10-04)