Erdős problem 307
Are there two finite set of primes and such that
Sources
FormalConjectures/ErdosProblems/
307.lean
Retained formal statement
There are no examples known of the weakened coprime version if we insist that .
sorry ↔ ∃ P Q, 0 ∉ P ∩ Q ∧ 1 ∉ P ∪ Q ∧ 1 < P.card ∧ 1 < Q.card ∧ (↑P).Pairwise Nat.Coprime ∧ (↑Q).Pairwise Nat.Coprime ∧ 1 = (∑ p ∈ P, (↑p)⁻¹) * ∑ q ∈ Q, (↑q)⁻¹OpenStatement only, no proof