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.

Sources

The source's own material, retained exactly.

11 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

56.lean

Retained formal statement10 of 11

An example of a k-weakly divisible set is the subset of {1, ..., N} containing the multiples of the first k primes.

FormalConjectures/ErdosProblems/56.leanErdos56.weaklyDivisible_firstPrimesMultiples1 lineExact file
∀ (N k : ℕ), Erdos56.WeaklyDivisible k (Erdos56.FirstPrimesMultiples N k)
APIStatement only, no proof