Skip to content

Erdős problem 46

Does every finite colouring of the integers have a monochromatic solution to 1=1ni1=\sum \frac{1}{n_i} with 2n1<<nk2\leq n_1<\cdots <n_k?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#46
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page