Skip to content

Erdős problem 487

Let A⊆NA\subseteq \mathbb{N} have positive density. Must there exist distinct a,b,c∈Aa,b,c\in A such that [a,b]=c[a,b]=c (where [a,b][a,b] is the least common multiple of aa and bb)?

Sources

The source's own material, retained exactly.

1 retained statement36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

487.lean

Retained formal statement1 of 1

Let A⊆NA\subseteq \mathbb{N} have positive density. Must there exist distinct a,b,c∈Aa,b,c\in A such that [a,b]=c[a,b]=c (where [a,b][a,b] is the least common multiple of aa and bb)?

This is true, a consequence of the positive solution to [447] by Kleitman [Kl71].

Davenport and Erdős [DaEr36] showed that there must exist an infinite sequence a1<a2⋯a_1<a_2\cdots in AA such that ai∣aja_i\mid a_j for all i≤ji\leq j, under the assumption that the upper logarithmic density of AA is positive.

FormalConjectures/ErdosProblems/487.leanErdos487.erdos_4871 lineExact file
True ↔ ∀ (A : Set ℕ), A.HasPosDensity → ∃ a ∈ A, ∃ b ∈ A, ∃ c ∈ A, a ≠ b ∧ b ≠ c ∧ a ≠ c ∧ a.lcm b = c
SolvedProof has a holelean4external proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.