← All problems

Erdős Problem #893 — Doubling ratios of divisor sums of Mersenne numbers

30 years old · traced to

For each positive integer mm, let τ(m)\tau(m) be the number of its positive divisors. For each positive integer nn, define

f(n)=∑k=1nτ(2k−1).f(n)=\sum_{k=1}^{n}\tau(2^k-1).

Does the sequence

f(2n)f(n),n=1,2,…,\frac{f(2n)}{f(n)},\qquad n=1,2,\ldots,

converge to a finite real limit as n→∞n\to\infty? Whether it instead tends to +∞+\infty is a distinct possibility. Erdős Problem #893

Background

The question is attributed to Erdős's 1998 discussion of new and nearly new problems in combinatorial number theory. He remarked that there was probably no simple asymptotic formula for f(n)f(n), since it increases too fast; the doubling ratio asks whether its growth has a more tractable regularity. Erdős Problem #893 Erdős (1998)

References

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.