Skip to content

Erdős problem 348

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.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:c03e6f9072f157e130fd6f51348cb30d4809e6c2438b29643b1577432f764533
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page