Does every finite colouring of the integers have a monochromatic solution to $1 = \sum \frac{1}{n _{i}}$ with $2 \leq n_{1} < \dots < n_{k}$ ?

unreviewedOpen. Worked here; no verified result yet.

number theory · solved · 0 attempts

use this data

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

Connections1

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Search Vela