Erdős problem 56 · problems.science

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/56.lean

Formal Conjectures

FormalConjectures/ErdosProblems/56.leanErdos56.empty_iff_weaklyDivisible_zero1 lineExact file

1∀ {A : Finset ℕ}, Erdos56.WeaklyDivisible 0 A ↔ A = ∅

APIStatement only, no proof

Proof manifests naming this Problem

Jayyhk Erdős Leanjayyhk:erdos:56
PLBY Lean proofsErdosProblems.Erdos56

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Formalization
Erdős AI contributions wiki · 25 Nov, 2025-27 May, 2026
Machine
Aristotle, GPT
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Proof manifests naming this Problem

Reported activity

Continue

Search problems.science