is this identity true (i believe it is)?

 

p*int(f,x=0..infinity) = sum ((int(f,x=n..n+p)),n=0..n+p) + sum((p-n)*(int(f,x=n-1..n)),n=1...p-1)

 

p*(int(f(x), x = 0 .. infinity)) = sum(int(f(x), x = n .. n+p), n = 0 .. n+p)+sum((p-n)*(int(f(x), x = n-1 .. n)), n = 1 .. p-1)

 

If it is true how we understand it, and understand it through Maple.

I have a set of data. The number of times an event occurred each day. So my data set looks like, [[daynum, numevents]] == [[1,3],[2,1],[3,5],...] where daynum is the day number, and numevents is the number of times an event occurred that day. What I want to do is plot these like a histogram, or barchart, or column graph (I'm not very good at stats, so I may not know what I'm talking about here) - anyway, something like that - with daynum on the horizontal axis and numevents on the vertical axis. And the numevent should be a tall rectangle with height = numevent value.

My first question is :   How can I count the number of recent calls to a procedure (not exprofile) ?

for example:

X := proc ()
Sample(RandomVariable(Normal(0, 1)), 1)[1]
end proc;
X();  X() ;

should return 2
 

 

My second question is:  

I have a procedure as seen below which I plot in a component plot  Do(%Plot0=X(%Slider_mu,%Slider_sigma,%Slider_t));

The Do call has 3 sliders inputs in the form of mu, sigma, tt.

ComplexExpand[(1 + I)^n + (1 - I)^n]

this is in mathematica

 

In the previous post, I described why parallel programming is hard. Now I am going to start describing techniques for writing parallel code that works correctly.

First some definitions.

• thread safe: code that works correctly even when called in parallel.
• critical section: an area of code that will not work correctly if run in parallel.
• shared: a resource that can be accessed by more than one thread.
• mutex: a programming tool that controls access to a section of code

I am taking a LA course, no problem with the math.  But Maple I don't know, and we are using Maple 12 student edition.  I have never used Maple and our underly-helpful teacher's answer is "go watch the training videos".

Here

I am taking a LA course, no problem with the math.  But Maple I don't know, and we are using Maple 12 student edition.  I have never used Maple and our underly-helpful teacher's answer is "go watch the training videos".

Here

how to convert the vertical output to horizontal,and how to cite the result.

 

 for n to 20 do evalf(f(n)) end do;

I know very little about the Kalman filter. The thing that I do know is that the Kalman filter has great potential.

However I am not sure that I want to invest time doing reasearch on it because I am not sure I

will be able to come up with an working model in Maple. Does anyone have any experience with Kalman filter in Maple ?

Does anyone want to explain how such a model works ?!

HI there, I have a quick question and I just want to confirm what I found. I was trying to do some Fourier Transform using the MTM package and I was successful in doing so for one dimensional problems when it's only f(x) but when I tried to do something more complicate like 2D fourier transform when the f is a function of x and y ie. f(x,y), Maple seems not able to do it. I checked with help menu and it seems it can support only 1D. is there anything other package that I'm not aware of that is capable of a such thing?

Greetings All

I just wanted to test some values in the Rydberg Formula:

eq1 := 1/L = R(1/nfinal^2-1/nstart^2)

sol1:= solve(eq1, L)

and the answer looks correct:

1/R(-(-nstart^2+nfinal^2)/(nfinal^2*nstart^2))

 

But when I go and try and solve for these other variables I get

solve(eq1, nfinal)  ----->  I get an "Error, (in evala/Reduce/ff/monomial) numeric exception: division by zero"

solve(eq1, nstart)  --->   I get nfinal^2/(-1+RootOf(R(_Z)*L-1)*nfinal^2)

http://demonstrations.wolfram.com/LearnTheGameOfGo/

here is a simple expamle,but it's not a game.

And the computer's AI can be developed.

If anyone know should use which programming language,I know C,C++,matlab,mathematica,

and what's that I should learn?

 

Hi,

I often use  the display(plot1, plot2, ..., axis[1]=[tickmarks=[0,100,200,300,400], gridlines=[5, subticks=true]], axis[2]=[tickmarks=8, gridlines=[8, subticks=true]]) command to plot several plots in one and to adjust the gridlines to what looks better than the default.

I'm spliting up a number into a list but I'm not sure if this is the best way.

a:=74.367854;

b:= convert(a, string);

with(StringTools);

c:=Select(IsAlphaNumeric,b);

d:=Explode(c);

e:=seq(parse(d[i]),i=1..nops(d));

                                            7,4,3,6,7,8,5,4

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!