【matlab基础知识代码】（十）级数求和与序列求积

 

 

>> format long; sum(2.^[0:63])

ans =

     1.844674407370955e+19

>> syms k;symsum(2^k,0,63)
 
ans =
 
18446744073709551615
 
>> sum(sym(2).^[0:200])
 
ans =
 
3213876088517980551083924184682325205044405987565585670602751

 

>> syms n;symsum(1/((3*n-2)*(3*n+1)),n,1,inf)
 
ans =
 
1/3

使用数值方法

>>  m=1:10000000; s1=sum(1./((3*m-2).*(3*m+1))); format long; s1

s1 =

   0.333333322222223

>>  syms n x; s1=symsum(2/((2*n+1)*(2*x+1)^(2*n+1)),n,0,inf); 
simplify(s1)
 
ans =
 
piecewise(1 < abs(2*x + 1), 2*atanh(1/(2*x + 1)))

 得到收敛区域，级数的和

>>  syms m n; limit(symsum(1/m,m,1,n)-log(n),n,inf)
 
ans =
 
eulergamma

 

>> syms k n; simplify(limit(symsum((1+k/n^2)*sin(k*pi/n^2),k,1,n-1),n,inf))
 
ans =
 
pi/2

 

>>  syms k n; P1=symprod((1+1/k^3),k,1,n);simplify(P1)
 
ans =
 
-(factorial(n + 1)*sin(pi*((3^(1/2)*1i)/2 - 1/2))*gamma(n - (3^(1/2)*1i)/2 + 1/2)*gamma(n + (3^(1/2)*1i)/2 + 1/2))/(pi*factorial(n)^3)
 
>>  P2=symprod((1+1/k^3),k,1,inf);simplify(P2)
 
ans =
 
cos((pi*3^(1/2)*1i)/2)/pi

 

>>  syms k n, S=1+symsum((-1)^n*symprod((1-1/(2*k)),k,1,n),n,1,inf)
 
S =
 
2^(1/2)/2