I was trying to calculate this for some integer *n* < = 10^{9} :

In other words summation of summation of ... (m times summations) of divisors of *n*.

If anyone can help me out with this!

# | User | Rating |
---|---|---|

1 | tourist | 3581 |

2 | OO0OOO00O0OOO0O0…O | 3327 |

3 | Petr | 3161 |

4 | LHiC | 3158 |

5 | CongLingDanPaiSh…5 | 3116 |

6 | ko_osaga | 3115 |

7 | mnbvmar | 3111 |

8 | Um_nik | 3104 |

9 | Benq | 3098 |

10 | Swistakk | 3089 |

# | User | Contrib. |
---|---|---|

1 | Radewoosh | 185 |

2 | Errichto | 163 |

3 | rng_58 | 161 |

4 | tourist | 158 |

5 | Vovuh | 150 |

5 | Um_nik | 150 |

7 | Petr | 149 |

7 | Swistakk | 149 |

9 | PikMike | 148 |

10 | 300iq | 147 |

10 | neal | 147 |

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/18/2018 17:58:04 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

Let's denote your summation by f(m,n).

First, prove that f(m,*) is multiplicative. This can be easily proved by induction, assuming f(m-1,*) are multiplicative, and obviously f(0,*) is 1, which is multiplicative.

Hence, factorise n into prime powers, and multiply the answers for individual prime powers.

So, now you only need to solve f(m,n) where n is of the form (p^a) where p is some prime.

Another observation tells you that p is irrelevant, only the value of 'a' matters, so let's call g(m,a) = f(m,p^a)

Writing the obvious recursion from g, by the given definition of f, we get

g(m,a) = g(m-1,0) + g(m-1,1) + ... + g(m-1,a)

with base case g(0,x) = 1

We can see that this is equivalent to distributing 'a' objects in 'm+1' places, where the recursion for g indicates looping on number of objects in the 1st place.

So, g(m,a) = C(a+m,m)

I believe this solves your problem. I might have missed something here or there or maybe did some off by 1 error, but the basic idea is this only, you'll get a bunch of C(n,r) terms and the function is multiplicative.

Perfect!