Erdős problem 46 · problems.science

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$ ?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:3b5fcc4fa84f83b885ab5f6d3a73ff7a4f924d8dd94e1acd63a8a3203a811d07
Metadata: sha256:ab988a345dcb9947f3f1a1b520003e9d9bfc204ce6d320eb7fe28e5850c5ed96
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:91432936981903387ada160d44bb28cb0eb2545cd258add1b4d82cb3900f0eb4

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207