Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Kernel-checkable prime factor certificate

Definition
PrimePairSieve_reciprocal_weight_check

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

five-primesnumber-theory

Boolean test that a finite set of primes multiplies to a given nnn; used to certify squarefree indices in sparse reciprocal-sieve tables.

Definition code
import Mathlib
import Definitions.Def_PrimePairSieve_ReciprocalLiteralWeight
open scoped BigOperators
set_option autoImplicit false
namespace PrimePairSieve
def reciprocal_weight_check (n : ℕ) (s : Finset ℕ) : Bool :=
  decide ((∀ p ∈ s, Nat.Prime p) ∧ (∏ p ∈ s, p) = n)
end PrimePairSieve

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