Questions using the Sum command, especially for series and other algebraic objects, and related functions such as SumConvergence

learn more… | top users | synonyms

2
votes
1answer
194 views

Simplify results further

I have an extremely long result in polynomial form following some matrix operations. However, given the symmetry of the problem, I can safely say that the solution will reduce much further than is ...
1
vote
1answer
48 views

How to deduce the Ramanujan's summation of this series?

I have already asked a similar question about Ramanujan's summation in general but received no good answers. Now I am interested in this exact series: $$\sum _{n\ge1}^\Re (24 n + 12 n^2)$$
1
vote
1answer
86 views

Need to take infinite sum of residues, is there a way to choose the order of operations for ReleaseHold?

I'm computing an infinite sum of residues. I want to do something like this: ...
7
votes
0answers
173 views

Incorrect evaluation for Thue-Morse signed harmonic series

I would like to evaluate $$s = 1 - \frac{1}{2} - \frac{1}{3} + \frac{1}{4} - \frac{1}{5} + \frac{1}{6}+\frac{1}{7}-\frac{1}{8} - ... + \frac{(-1)^{\textrm{binary digit sum}(n-1)}}{n} + ... $$ where ...
5
votes
0answers
60 views

SumConvergence fails in version 10

SumConvergence[(-1)^(n + 1) ((Cos[n^2] + Sin[n + 2])/7^n), n] Mathematica fails to provide a result (true/false) but wolfram alpha works. What should I do ? It ...
2
votes
0answers
53 views

Simplifying symbolic multiple sums

suppose I have a multiple sum with an unspecified number of indexes: $$\sum_{i_1=1}^n \ldots \sum_{i_k=1}^n x_{i_1}\otimes\ldots\otimes \hat{x_{i_j}}\otimes\ldots\otimes x_{i_k}$$ with $x_{i_j}$ ...
2
votes
0answers
40 views

Why does Mathematica provide incosistent convergence conditions?

In[1]:= Clear[a, n] In[2]:= SumConvergence[(n^(n - 2))/((a^n)*(n!)), n] Out[2]= Abs[a] > E In[3]:= SumConvergence[(n^(n - 2))/((E^n)*(n!)), n] Out[3]= True All ...
2
votes
0answers
163 views

Computing a sum

I'm trying to make Mathematica compute this sum: Sum[(-1)^k (n - k)^2 Binomial[2 n, k], {k, 0, n}] As is, I get an awful formula: ...
2
votes
0answers
222 views

Faster Ways to compute recursive summation

It takes a long time to compute the summation below, and I'd like to know if there are some better ways to compute things faster. I have used $3$ ways to calculate, but they are very unsatisfactory. I ...
2
votes
0answers
82 views

Limit[Sum[(2*E*n)^w/(w^(n/2+w)), {w,2,n}],n->Infinity]

I would like to show that the following (and other similar formulae) tends to zero. Limit[Sum[(2*E*n)^w/(w^(n/2+w)), {w,2,n}],n->Infinity] What's the right ...
1
vote
0answers
47 views

Does Sum calculate all terms before summing them?

After calculating the sum of a large number of large objects, using B = Sum[RandomInteger[{0, 1}, {10^6}], {100}]; I find that ...
1
vote
0answers
59 views

Improve speed of evaluating a sum over four indices

I am trying to implement the Fox-H function with several variables as sum of residues. I have arrived at the following function; ...
1
vote
0answers
90 views

Real part of a sum

I would like to take the real part of the following expression: Sum[(a[i] + I b[i]) r^i/(r^2 + z^2)^i, {i, 0, 2 n}] where all of ...
1
vote
0answers
78 views

FullSimplify missing trivial rewrite

I'm trying to understand why Mathematica fails to find the Stirling numbers in the second sum below: ...
1
vote
0answers
103 views

Summing the probability distribution to 1 to convince myself

I have worked out a probability distribution and want to check its sum which is necessarily 1. First we write $$ r \triangleq \frac{(2 \lambda + \mu)^2}{2(\mu + \lambda)^2}, \quad s \triangleq ...
1
vote
0answers
88 views

How to evaluate sums that have 0^0 = 1

In my code: ...
1
vote
0answers
74 views

Summing a trig series

I am trying to sum the following expression: (Cos[(2 π m)/N]^2 Cos[(2 π n)/ N])/(2 (Cos[(2 m π)/N] - Cos[(2 n π)/N])) from ...
1
vote
0answers
69 views

Manipulating infinite series

If I type Sum[f[x],{x,m,Infinity}]-Sum[f[x],{x,m+3,Infinity}] I would like Mathematica to return something like ...
0
votes
0answers
67 views

Replacing function in Sum

I have this expression, which, after execution, gives these $F[s,r]$ in output. $$ S_{1,1}=\sum _{s=1}^{16} \sum _{r=1}^{16} F(s,r) \text{Tr}\left[G_r.G_1.G_s.G_1\right] $$ Here is a piece of ...
0
votes
0answers
54 views

Iteration variable in Sum gets assigned the final iteration value

I've got a function which is defined iteratively via ...
0
votes
0answers
131 views

Simplifying terms in a Sum expression

I have a sum in the form of pure function s = Sum[f[k], {k, 0, # - 1}] & of perhaps complicated terms f[k]. The terms ...
0
votes
0answers
125 views

Writing rules for Einstein summation

I'm trying to write a list of rules for tensor manipulations and in particular, Einstein summation convention. What I've tried, so far is to write something that would take a generic functions with ...
0
votes
0answers
37 views

Failed to use SetPrecision

I am calculating the below formula: $$ \text{ER2}(\alpha,\text{K},\text{q})\text{:=}1+\sum _{m=0}^{K-1} \binom{K+\alpha }{m} \sum _{r=0}^m \frac{(-1)^r \binom{m}{r}}{\left(\frac{1}{q}\right)^{\alpha ...
0
votes
0answers
43 views

Regarding Cycles and Lists of Functions

So, I'm trying to determine the Normal Matrix of a Least Squares Aproximation; I have a basis constituted by 8 functions f1,f2...f8; I have 9 points which constitute Datax = {x1,x2...x9} Now, I ...
0
votes
0answers
51 views

More on performance of Sum[]

There is an interesting discussion on performance of Sum[] in this question. I actually wanted to reproduce findings from this answer. So, I entered: ...
0
votes
0answers
59 views

Expectation taking unusually long to evaluate

I am trying to evaluate an expectation, but it is taking an extremely long time although the expression itself should not be too complicated. My code is ...
-1
votes
0answers
66 views

problem in solving by Sum

I'm going to solve a problem by using \Sum But as i have many parameter (14) that all are used in sum the running time is awful my program is like this ...