Skip to content

Erdős problem 539

Start work

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.

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal8 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Open the source record
Where the source files it575 share a topic
Number Theory576
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources