Erdős Problem #856
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
A finite set `A` of natural numbers contains `k` distinct elements with the same pairwise least common multiple: there is a subset `S ⊆ A` of size `k` and a number `L` such that `lcm a b = L` for all distinct `a, b ∈ S`.
\(f_k(N)\) is the maximum of \(\sum_{n \in A} 1/n\) over all \(A \subseteq \{1, \ldots, N\}\) that contain no `k` distinct elements with the same pairwise least common multiple. The set of values is finite and contains `0` (for `A = ∅`) when `k ≥ 1`, so the `sSup` is a maximum.
Attempts
submit one →Read our working report →
The authoritative live page is OPEN and shows “Currently working on this problem: None”, but it lists 1 claimed proof—a full proof claimed by RayYoung, Keheng Zhu, and Yanping Luo, submitted 2026-07-1
SKIPPED