Skip to content

Erdős problem 307

Are there two finite set of primes PP and QQ such that

Sources

Browse retained paths and inspect the exact material available for this Problem.

4 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

307.lean

Retained formal statement1 of 4

Are there two finite set of primes PP and QQ such that

1=(pP1p)(qQ1q) 1 = \left( \sum_{p \in P} \frac{1}{p} \right) \left( \sum_{q \in Q} \frac{1}{q} \right) ?

Asked by Barbeau [Ba76].

[Ba76] Barbeau, E. J., _Computer challenge corner: Problem 477: A brute force program._

FormalConjectures/ErdosProblems/307.leanErdos307.erdos_3071 lineExact file
sorry ↔ ∃ P Q, (∀ pP, Nat.Prime p) ∧ (∀ qQ, Nat.Prime q) ∧ 1 = (∑ pP, (↑p)⁻¹) * ∑ qQ, (↑q)⁻¹
OpenStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page