All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsCombinatorics

Erdős Problem 307: Coprime One Not Mem

There are no examples known of the weakened coprime version if we insist that 1∉PQ1\not\in P\cup Q.

Mathematical statement

There are no examples known of the weakened coprime version if we insist that 1∉PQ1\not\in P\cup Q.

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_307.variants.coprime_one_notMem

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_307.variants.coprime_one_notMem : answer(sorry)   P Q : Finset , 0  P ∩ Q  1  P ∪ Q     1 < #P  1 < #Q  Set.Pairwise P Nat.Coprime  Set.Pairwise Q Nat.Coprime     1 = (∑ p  P, (p : )⁻¹) * (∑ q  Q, (q : )⁻¹) := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References