Erdős Problem a Daythe open tracker

Erdős Problem #856

OPENdatabase updated 2025-08-31

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.

Let \(k\geq 3\) and \(f_k(N)\) be the maximum value of \(\sum_{n\in A}\frac{1}{n}\), where \(A\) ranges over all subsets of \(\{1,\ldots,N\}\) which contain no subset of size \(k\) with the same pairwise least common multiple. Estimate \(f_k(N)\). This is the question of Erdős [Er70, p. 127]. We read "estimate" as \(f_k(N) = \Theta(\text{answer})\) as \(N \to \infty\), for each fixed \(k\).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open · 4 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/856.
Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/856
WORKING REPORT BY THIS SITE · JUL 27, 2026

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