Skip to content

Erdős problem 348

Start work

For what values of 0≤m<n0 \leq m < n is there a complete sequence A={a1≤a2≤⋯ }A = \{a_1 \leq a_2 \leq \cdots\} of integers such that 1. AA remains complete after removing any mm elements, but 2. AA is not complete after removing any nn elements.

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:7aaaa51ff72c100b089e71c337cc9cf75f58e213d5d3824e50712c5561a11974
Metadata
sha256:71a1df47fab37eec1057e644192fa23a1c3f5c1168e8acb8e1c98993c2de8375
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:c03e6f9072f157e130fd6f51348cb30d4809e6c2438b29643b1577432f764533
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON