Skip to content

Problem

erdos:539

For A=n|A| = n, how small can the cofactor set Q(A)={a/gcd(a,b):a,bA}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(logn))h(n) \le n^{1/2} \exp(O(\sqrt{\log n})) matches the classical lower bound.

Declared status
open
Formalization
formalized
OEIS
possible

Matching claims

0
No direct claims
This problem has no directly related claim record.

Search problems.science

Find a Problem, Result, source, or page