Skip to content

Erdős problem 539

For ∣A∣=n|A| = n, how small can the cofactor set Q(A)={a/gcd⁡(a,b):a,b∈A}Q(A) = \{a / \gcd(a,b) : a, b \in A\} be? The answer is h(n)=n1/2+o(1)h(n) = n^{1/2 + o(1)}: a new upper bound h(n)≤n1/2exp⁡(O(log⁡n))h(n) \le n^{1/2} \exp(O(\sqrt{\log n})) matches the classical lower bound.

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/539.lean

Formal Conjectures

FormalConjectures/ErdosProblems/539.leanErdos539.erdos_5391 lineExact file
(fun n => ↑(Erdos539.cofactorThreshold n)) =Θ[Filter.atTop] sorry
OpenStatement only, no proof

Reported activity

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

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page