Kernel-checkable prime factor certificate
DefinitionPrimePairSieve_reciprocal_weight_checkfive-primesnumber-theory
Boolean test that a finite set of primes multiplies to a given ; 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