← All problems

Erdős Problem #252 — Irrationality of divisor power sum series

73 years old · traced to

For each integer k≥1k\geq 1, define the divisor power sum, for positive integers nn, by

σk(n)=∑d∣ndk,\sigma_k(n)=\sum_{d\mid n} d^k,

where the sum is over the positive divisors of nn. Set

αk=∑n=1∞σk(n)n!.\alpha_k=\sum_{n=1}^{\infty}\frac{\sigma_k(n)}{n!}.

(The series converges, for example since σk(n)≤nk+1\sigma_k(n)\leq n^{k+1} and the factorial dominates any fixed power.) Is αk\alpha_k irrational for every integer k≥1k\geq 1? Erdős Problems #252 The irrationality of a divisor function series of Erdős and Kac

Background

Erdős and Kac posed the question of whether these factorially weighted divisor sums are irrational for every positive integer kk. Erdős had already observed that the cases k=1k=1 and k=2k=2 are comparatively accessible; the problem is substantially harder from k=3k=3 onward. The irrationality of a divisor function series of Erdős and Kac Erdős (1952) Erdős Problems #252

The later advances use sieve methods to control arithmetic properties of the divisor sums. The proofs for k=3k=3 and k=4k=4 illustrate how much more delicate the problem becomes beyond the first two cases. The irrationality of a divisor function series of Erdős and Kac

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.