Erdős problem 307
Are there two finite set of primes and such that
Sources
FormalConjectures/ErdosProblems/
307.lean
Retained formal statement
Instead of asking for sets of primes, ask only that all elements in the sets be relatively coprime.
Cambie has found several examples when this weakened version is true. For example, and
True ↔ ∃ P Q, 0 ∉ P ∩ Q ∧ 1 < P.card ∧ 1 < Q.card ∧ (↑P).Pairwise Nat.Coprime ∧ (↑Q).Pairwise Nat.Coprime ∧ 1 = (∑ p ∈ P, (↑p)⁻¹) * ∑ q ∈ Q, (↑q)⁻¹TextbookStatement only, no proof