Erdős Problem #277 — The following extremal problem can now be posed: Put … where the maximum is to be taken over all the mm for which the divisors of mm do not form a covering system.

About 46 years old · traced to

The following extremal problem can now be posed: Put

f(x)=max⁡m<xσ(m)/mf(x) = \max_{m < x} \sigma(m)/m

where the maximum is to be taken over all the mm for which the divisors of mm do not form a covering system. By Haight's theorem f(x)f(x) tends to infinity as x→∞x \to \infty. Is it true that f(x)=o(log⁡log⁡x)f(x) = o(\log\log x). In other words does f(x)f(x) tend to infinity much slower than max⁡σ(m)/m\max \sigma(m)/m.

References

Additional references

P. Erdős, A survey of problems in combinatorial number theory, Ann. Discrete Math. 6 (1980), 89-115.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.