/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
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$.
The exponent $c_k = \frac{k-2}{e,((k-2)!)^{1/(k-2)}}$ of [TaZh25b, Theorem 1.2] (called $b_k$
on the problem page, where $c_k$ denotes the upper exponent).
Tang and Zhang [TaZh25b, Corollary 1.7] proved, as $N\to\infty$,
$$(\log N)^{\log(1.551)-o(1)}\leq f_3(N)\ll(\log N)^{\frac{3}{2^{2/3}}-1+o(1)}.$$
This is the lower bound, with the $o(1)$ stated with an arbitrary $\varepsilon > 0$. Since
$\log(1.551) = 0.4389\ldots$, it implies the site's $(\log N)^{0.438}\leq f_3(N)$ for large $N$.
Tang and Zhang [TaZh25b, Corollary 1.7] proved, as $N\to\infty$,
$$(\log N)^{\log(1.551)-o(1)}\leq f_3(N)\ll(\log N)^{\frac{3}{2^{2/3}}-1+o(1)}.$$
This is the upper bound, with the $o(1)$ and the implied constant absorbed into an arbitrary
$\varepsilon > 0$. The site rounds the exponent to $0.889$, but $\frac{3}{2^{2/3}}-1=0.8898\ldots$.