Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
Let $a/b\in \mathbb{Q}_{>0}$ with $b$ squarefree. Are there integers $1<n_1<\cdots<n_k$, each the product of two distinct primes, such that\[\frac{a}{b}=\frac{1}{n_1}+\cdots+\frac{1}{n_k}?\]
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.
For $n_i$ the product of three distinct primes, this is true when $b=1$, as proved by Butler, Erdős and Graham [BEG15] (this paper is perhaps Erdős' last paper, appearing 19 years after his death).

View the LaTeX source

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

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 #306, https://www.erdosproblems.com/306, accessed 2026-01-16