Let denote the sum of powers of all the positive integer divisors of . For example, . Find the infimum of such that the series above converges.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Note that we can write the sum as n ≥ 1 ∑ d ∣ n ∑ n M d k where k = 2 0 1 6 . We can re write the sum as d ≥ 1 ∑ l ≥ 1 ∑ ( l d ) M d k = d ≥ 1 ∑ d M − k 1 l ≥ 1 ∑ l M 1 = ζ ( M − k ) ζ ( M ) Note that the sum converges as long as M > k + 1 . So, we get in f M = k + 1 = 2 0 1 7 .