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

In my previous post, I tried to convince you that going parallel is necessary for high performance applications. In this post, I am going to show what makes parallel programming different, and why that makes it harder.

Here are some definitions used in this post:

• process: the operating system level representation of a running executable. Each process has memory that is protected from other processes.
• thread: within a single process each thread represents an independent, concurrent path of execution. Threads within a process share memory.

We think of a function as a series of discrete steps. Lets say a function f, is composed of steps f1, f2, f3... e.g.

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):

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)

I started six month ago with what I though at the time to be a simple question.

Why is the mean in the Black and Scholes model assumed to be (mu-(1/2)*sigma^2)*T ?

I had seen numerous attempts of deriving such an relationship on the Internet but every solution that I found always had some flaw in the step-by-step mathematical logic which meant that the solution was rendered useless.