← All problems

Erdős Problem #419 — Limit Points of the Factorial Divisor Ratio

1 year old · traced to

For each positive integer nn, let τ(n)\tau(n) be the number of its positive divisors, and put

Rn=τ((n+1)!)τ(n!).R_n=\frac{\tau((n+1)!)}{\tau(n!)}.

Determine the set L\mathcal L of finite real limits of subsequences whose indices tend to infinity; explicitly,

L={x∈R:there are positive integers nj→∞ with Rnj→x}.\mathcal L=\left\{x\in\mathbb R: \text{there are positive integers } n_j\to\infty \text{ with } R_{n_j}\to x\right\}.

Is it true that

L={1}∪{1+1k:k∈Z≥1}?\mathcal L=\{1\}\cup\left\{1+\frac1k:k\in\mathbb Z_{\ge 1}\right\}?

Erdős Problem #419

Background

Erdős and Graham posed the question in their 1980 work on the divisor function of factorials. They noted that each value 1+1/k1+1/k, for positive integer kk, is a limit point, and hence so is 11, but did not know whether other limit points occur. The problem is governed by how the prime factors of the newly added integer n+1n+1 alter the prime-exponent factorization of the divisor count. Erdős, Graham, Ivić, and Pomerance later established an asymptotic formula that resolves the question. Erdős Problem #419 Erdős, Graham, Ivić, and Pomerance, On the number of divisors of n! EGIP96

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.