Skip to content

Erdős problem 885

Start work

Is it true that, for every k≥1k \geq 1, there exist integers N1<⋯<NkN_1 < \dots < N_k such that ∣∩iD(Ni)∣≥k|\cap_i D(N_i)| \geq k?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:46bfb904f89c300c339089a796e6bfb1ae89e2fe154cccdb6c28d4596ca2cb63
Metadata
sha256:24402e585a35f80979eb7926e3b9084e1f5848df7d2331e2efd4e25d129abd96
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:5484b5b185ec5aebe447b2f29fceb8a1637b2a1c506647e0962cfc6e9508f7e0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON