Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I don't know much about number theory, it seems this summation might involve some facts from number theory.

Could you give me some idea of doing it? Thank you very much. The summation is

$$ g(n)=\sum_{d|n} f(d) $$

where $f(d)=k^d$, for some fixed positive integers $k$ and $n$.

for example,

if $n=6$, $g(6)=k+k^2+k^3+k^6$. thanks

if no formula, what is the asymptomatic behaviour of it when n large. thanks again.

share|cite|improve this question
It's annoying that $g$ is not multiplicative. One obvious observation: $g(n) = \Theta(k^n).$ – user7530 Jan 2 '13 at 9:35
Well let's see, it's the Dirichlet product of $f$ with the all $1$'s function. I don't know if that helps though. – Alexander Gruber Jan 3 '13 at 0:10
$$\sum_{d\mid n}x^d=\sum_{k=1}^\infty\frac{ln(x)^k\sigma_k(n)}{k!}$$ – Ethan Feb 2 '13 at 4:48

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.