Skip to content

Erdős problem 46

Start work

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

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:3b5fcc4fa84f83b885ab5f6d3a73ff7a4f924d8dd94e1acd63a8a3203a811d07
Metadata
sha256:ab988a345dcb9947f3f1a1b520003e9d9bfc204ce6d320eb7fe28e5850c5ed96
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:91432936981903387ada160d44bb28cb0eb2545cd258add1b4d82cb3900f0eb4
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON