Skip to content

Erdős problem 45

Start work

Let k≥2k\geq 2. Is there an integer nkn_k such that, if D={1<d<nk:d∣nk}D=\{ 1<d<n_k : d\mid n_k\}, then for any kk-colouring of DD there is a monochromatic subset D′⊆DD'\subseteq D such that ∑d∈D′1d=1\sum_{d\in D'}\frac{1}{d}=1?

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:2acaa549f721f7fc4812546807b36686374cc4326f9539136a8852a07f287444
Metadata
sha256:b2e9e4ecf76be4840575c3d6014181789938fdfc33cbae116836fa2ea670a192
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:e1d5e80ae26c81067687e7164e0b6dfa4572869e6fd300b64b7ee9fe2ad3e9d3
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON