Consider the following expression:

sCARA4 := -ln(-(mu/sigma^2)^(mu^2/(mu-sigma^2))*(sigma^2/mu)^(mu^2/(mu-sigma^2))+(sigma^2/mu)^(mu^2/(mu-sigma^2))*((exp(phi)*sigma^2+mu-sigma^2)*exp(-phi)/sigma^2)^(mu^2/(mu-sigma^2))+1)/phi;

Now try to find out whether the first derivative to mu is positive for all positive mu, phi and sigma, except for some rare exceptions (e.g. sigma^2=mu).

diff(%,mu);

Since 'is' is not a satisfying option, I used 'Explore'...

hi

please help me to solve this error.

Error.pdf 

Hey everyone.  I'm having problems solving a set of complicated PDEs.  I found a question before that helped me a bit, but the answer was less than ideal.

Here is what I have so far.

pde := [-1/4*Gamma*(Gamma-2)/r^2*G(v,r)+1/r^3*j[v](v,r)*Gamma-1/r*diff(h[vv](v,r),r)-1/r^2*h[vv](v,r)+1/2*1/r^2*diff(j[v](v,r),r)*Gamma = 0, 1/4*f(r)*Gamma*(Gamma-2)*G(v,r)/r^2+1/r*f(r)*diff(h[vv](v,r),r)+1/r*diff(h[vv](v,r),v)-1/r^2*f(r)*diff(j[v](v,r),r)*Gamma-1/r^2*diff(j[v...

maple_error.doc

Hello,

I have a plane x+2*y+3*z = 0 and a point A(1,2,3).

From A there are 3 lines :

P := (1, 2, 3) P1 := (-1, -1, 0) L1 := P+t*(P1-P)

How to find the cutting points between L1 and the above plane?

How to find a cutting points between planes? 2 3 4 planes etc.

It is urgent, please help me!

How do you map b into a to get [[a1,a2,b1],[a3,a4,b2],[a5,a6,b3]]

a:=[[a1,a2],[a3,a4],[a5,a6]]
b:=[b1,b2,b3]

Hello Colleagues:
I have tried to develop in Maple as shown in the following Gif.

What I've achieved is these few lines of commands:

I have the following script 

Download display_plot_-plot_s.mw

, where i tried to import two collumns of data from excel, what am i suppose to put after "display" to obtain the plot?

How do I evaluate moments of Q4 in a reasonable time with a reasonable accuracy, i.e. to a few decimal points:
   
with(Statistics): RV := 'RandomVariable(Geometric(1/3))+1'; R := `$`('RV', 5);

Q4 := 1/(alpha*R[1]+alpha^2*R[2]+alpha^3*R[3]+(1-alpha-alpha^2-alpha^3)*R[4]);

Moment(Q4, 1);

E.g., can I tell maple that replacing infinite series underlying this calculation with sufficiently long partial sums is okay with me? Or maybe there...

Hi friends,

I have windows 7, 64 bits, and I upgraded my maple to 64-bits version as well (Maple 13.02). But I wonder why in the task manager of windows, maple is still tagged as a 32 bits application (e.g. "maple.exe *32"  and  "mserver.exe *32")? In fact, I think the reason that I cannot run one my maple projects, which needs more than 2GB RAM, comes from this issue. Could you help me resolve the problem?

Thank you!

Hi all!

I would like to isolate a variable from an equation but after trying both solve and isolate I noticed they result in two different solutions. Which one is correct or in other words are there any issues with my syntax resulting in these differences?

The Maple ?Compiler can compile a limited subset of Maple commands to native code. The result is substantially faster than running interpreted Maple code. This article shows how you can save a compiled procedure for reuse.

When a Maple procedure is compiled, a shared object library (dynamic-linked library for Windows) is created on the file system, as a temporary file.  When the Maple...

To my mind I did all the necessary assumptions, to avoid that the summand will become singular when calculating the expected value.

What did I do wrong?

Here´s the code:

with(Statistics):
interface(showassumed=0):
assume(t::posint):
assume(x::posint):
assume(0 < q, q < 1):
X1 := RandomVariable(Geometric(q)):
DARA := t->log(t):
ExpectedValue(DARA(X1));

Hi everyone;

I would like to solve these ODE's.

1) d/dX(X*dΘ/dX)+ρ^2*X*Θ=0;Θ=Θ(X),ρ=constant

2)d/dr(r*d/dr(φ)-m^2(r*φ-n/m^2)=0;φ=φ(r),m,n=constant

Boundry Conditions are:

1)d/dX(Θ(L))=0,  2)Θ(0)=φ(R), 3)d/dX (Θ(0))+d/dr(φ(R))=0, 4)d/dr(φ(0))=0,   R,L=constant

Two of boundry conditions are Joint

Thanks

I'm using Maple 14 on 4-way and 6-way AMD 64 hardware running Windows Vista to numerically estimate inverses of a cumulative distribution function at hundreds of points, and am using the Task model to assign each point's inverse computation to a separate task. The cdf is a weighted sum of thousands of simpler functions, and so each task needs the weights. Initially I had set these up as a global variable, but after reading Darin Ohashi's MaplePrime's post ...