a) Let be the sum of all the positive integers divisors of a positive integer . Then, can be written as being a positive integer.
b) Let be the number of positive integers divisors of a positive integer . Then, can be written as being a positive integer.
Enter .
Bonus.- Generalize a) and b) ..
Asumption.- is Riemann-zeta function.
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.
For two functions f , g with domain N , the Dirichlet convolution f ⋆ g is the function ( f ⋆ g ) ( n ) = d ∣ n ∑ f ( d ) g ( d n ) n ∈ N For any function f with domain N define S f ( s ) = n ≥ 1 ∑ n s f ( n ) for s > 0 large enough to ensure convergence (if possible). It is a standard piece of bookwork that if S f ( s ) and S g ( s ) are absolutely convergent for s > T , then S f ⋆ g ( s ) is also absolutely convergent for s > T , and that S f ⋆ g ( s ) = S f ( s ) S g ( s ) s > T Note that ψ = 1 ⋆ 1 and σ = 1 ⋆ i where 1 ( n ) = 1 , i ( n ) = n for all n ≥ 1 . Since S 1 ( s ) = ζ ( s ) for s > 1 and S i ( s ) = ζ ( s − 1 ) for s > 2 , we deduce that S ψ ( s ) S σ ( s ) = = ζ ( s ) 2 ζ ( s ) ζ ( s − 1 ) s > 1 s > 2
Thus we have A = B = 2 0 1 8 , making the answer 1 0 0 9 .