Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exponential divisor functions

Published 13 Jul 2013 in math.NT | (1307.3683v2)

Abstract: Consider the operator $E$ on arithmetic functions such that $Ef$ is the multiplicative arithmetic function defined by $(Ef)(pa) = f(a)$ for every prime power $pa$. We investigate the behaviour of $Em\tau_k$, where $\tau_k$ is a $k$-dimensional divisor function and $Em$ stands for the $m$-fold iterate of $E$. We estimate the error terms of $\sum_{n\le x} Em\tau_k(n)$ for various combinations of $m$ and $k$. We also study properties of $Emf$ for arbitrary $f$ and sufficiently large $m$. Our study provides a unified approach to functions with exponential divisors. We improve special cases of the Dirichlet asymmetric divisor problem and several results on the exponential divisor and totient functions.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.