I need the formal solution to the inverse of (d(m) = sum of c(k)/(k-m)! from k = m+1 to j  for all m from 0 through j-1). Egorychev's theory of turning summations into complex integrals seems to work only on his chosen examples, namely, where the summation index, k, is the lower variable in the binomial coefficient, not the upper variables as in my case k-choose-m, if one redefines c(k) as c(k)*k! and d(m) as d(m)*m!  Any ideas?  Thanks! 

00:00:10,980 --> 00:00:12,780
it will not have gone though both slits.

> Why these spineness appeared in some certain value?for example

> But if x is not the value +-1.5,it doesn’t appear.

Good Morning,

Would anybody in the community please help me  to trouble shoot the problem with fsolve not producing result.

Regards,

a:=seq(1/x,x=1..10);

b:=evalf(a,4);

c:=matrix(2,10,[[a],[b]]);  

How do I swap this to a 2 column 10 row matrix.

The topic maybe not so rigor.

question1:

For example,here are four complex numbers.

B ={3/13 - (2 I)/13, 3/2 - (5 I)/2, -(7/2) - 13 I, 1 - 3 I}

List B can be easily manipulate like this in mathematica,

Re(B),Im(B)

In[31]:= Re[A]
Out[31]= {3/13,3/2,-(7/2),1}
In[32]:= Im[A]
Out[32]= {-(2/13),-(5/2),-13,-3}

and in maple,I creat the array like this:

n := (a, b, c, d)

a,b,c,d are the four elements corresponding  to List B above.

A:=Array([a,b,c,d])

hi

how can i find the convergence rate of the sequence:

(1+1/n)^n

how can i show that

(1+1/n)^(n+1/2) converges faster than (1+1/n)^n

Hi pro, When i use " maple help " in Maple version 12, I care Christoffel command but I have a question for assistant.

Example (I copy and paste from Maple 12 help):

Dear All

I am evaluating innerproducts between a cartesian basis set with an arbirtary operator, and the result is;

ans = <X|a[11]|X> + <X|a[12]|Y> + <X|a[13]|Z> +

           <Y|a[21]|X> + <Y|a[22]|Y> + <Y|a[23]|Z> +

           <Z|a[31]|X> + <Z|a[32|Y> + <Z|a[33]|Z>

I would like to put this into a matrix form (i.e. removing the bras and kets), so that

Let say that I want two have two inputs nods that each should give a random variable and one node

that simply adds them together and plots the result. How could that be accomplished ?!

proc(x) local t;
 t := x*x*x + 0*2;
 if true then sqrt(t); else t^2 end if;
 end proc;
proc(x) local

in maple 13,the result is

proc (x) local t; t := x*x*x; sqrt(t) end proc

not the simplified proc(x) local t; t := x^3 ; sqrt(t) end proc

 (this is in the reference book)