Skip to content

Erdős problem 56

Suppose A⊆{1,…,N}A \subseteq \{1,\dots,N\} is such that there are no k+1k+1 elements of AA which are relatively prime. An example is the set of all multiples of the first kk primes. Is this the largest such set? To avoid trivial counterexamples, we must insist that NN be at least the kkth prime.

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:efc5b0a137a47129fbc21d61f15b143956443be1c77072a62f044a568534f02a
Metadata
sha256:b06ec9e1b6b8b7d88304bd2a636c6a9ab2397cb11f3486c1afe932cef00bfe7f
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ffb08a6916c4bb74010a5a3407eb0c7bb2d8f98274113c1f2b928e40cfc61ce1
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb