PROVED
This has been solved in the affirmative.
Does every finite colouring of the integers have a monochromatic solution to $1=\sum \frac{1}{n_i}$ with $2\leq n_1<\cdots <n_k$?
The answer is yes, as proved by Croot
[Cr03] - indeed, there are infinitely many disjoint such monochromatic solutions.
In
[ErGr80] they also ask for a monochromatic representation of any $\frac{a}{b}>0$. This follows from the case of $1$ - indeed, consider the induced colouring of $\{\tfrac{n}{b}: b\mid n\}$. By the above there are $a$ solutions to\[1=\sum_i \frac{1}{n_i/b},\]and hence $a$ solutions to $\frac{1}{b}=\sum_i \frac{1}{n_i}$, where all $n_i$ are distinct (across the $a$ many solutions). Summing across all variables then yields $\frac{a}{b}=\sum_j \frac{1}{m_j}$ where all $m_j$ are distinct and the same colour, as required.
See also
[298].
View the LaTeX source
Additional thanks to: Euro Vidal Sampaio
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 #46, https://www.erdosproblems.com/46, accessed 2025-12-07