Dual View Random Solved Random Open
VERIFIABLE Open, but could be proved with a finite example.
Are there two finite sets of primes $P,Q$ such that\[1=\left(\sum_{p\in P}\frac{1}{p}\right)\left(\sum_{q\in Q}\frac{1}{q}\right)?\]
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
Asked by Barbeau [Ba76]. Can this be done if we drop the requirement that all $p\in P$ are prime and just ask for them to be relatively coprime, and similarly for $Q$?

Cambie has found several examples when this weakened version is true. For example,\[1=\left(1+\frac{1}{5}\right)\left(\frac{1}{2}+\frac{1}{3}\right)\]and\[1=\left(1+\frac{1}{41}\right)\left(\frac{1}{2}+\frac{1}{3}+\frac{1}{7}\right).\]There are no examples known of the weakened coprime version if we insist that $1\not\in P\cup Q$.

It is easy to see that, if $P$ and $Q$ are sets of primes, then $P$ and $Q$ are disjoint, and $\sum_{p\in P\cup Q}\frac{1}{p}\geq 2$, whence $\lvert P\cup Q\rvert \geq 60$.

View the LaTeX source

External data from the database - you can help update this
Formalised statement? Yes
Likes this problem RomanLeLan, KStar, thomas
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None

Additional thanks to: Stijn Cambie

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #307, https://www.erdosproblems.com/307, accessed 2026-01-16