Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

Is there a procedure/algorithm for calculating sums of the form

$$ \sum_{n_1,\ldots,n_r >0} \frac1{L_1(n_1,\ldots,n_r)^{m_1} \ldots L_r(n_1,\ldots,n_r)^{m_r}} $$ where $$ L_i(n_1,\ldots, n_r) := a_{1,i} n_1 + \ldots + a_{r,i} n_r $$ for some $a_{i,j} \in \mathbb C$. How would one go about evaluating this sum to say 20 or 30 digits?

share|cite|improve this question
Asked and still unanswered on MO... – J. M. Dec 9 '10 at 14:07

Your Answer


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