we have the following:

  CM := MultiSeries:-series((c[1]*e+c[2]*e^2+c[3]*e^3+c[4]*e^4+O(e^5))^m, e)

we have the following:

CM := MultiSeries:-series((c[1]*e+c[2]*e^2+c[3]*e^3+c[4]*e^4+O(e^5))^m, e)

CM := c[1]^m*e^m+c[2]*m*c[1]^m*e^(1+m)/c[1]+(1/2)*m*(2*c[3]*c[1]+c[2]^2*m-c[2]^2)*c[1]^m*e^(2+m)/c[1]^2+(1/6)*m*(6*c[4]*c[1]^2+6*c[3]*c[2]*c[1]*m-6*c[3]*c[2]*c[1]+c[2]^3*m^2-3*c[2]^3*m+2*c[2]^3)*c[1]^m*e^(3+m)/c[1]^3+O(e^(4+m))

Hi all,

I am helping a friend.

Please see the two expressions that we would like to convert from Maple into Matlab:

http://yfrog.com/jdexpression3j

In the first one, why doesn't Maple first calculate g1^(2/3) and g2^(2/3) as common expressions, then use them to calculate the whole expression?

The (0.1e1/0.3e1) stuff looks very bad.

In the second one, we just couldn't get Maple to cancel the common factor g1^(2/3) in both numerator and denominator before doing the conversion to Matlab.

Initial conditions,     x(0)=2, D(x(0))= -2

D= differential

D2x +5Dx +4x = delta( t - 2 )
 

I want to check my answer in maple but i cant get it to work.

This is the answer i gt by hand

x = H( t - 2 ) ( ( e ^ - 4 ( t - 2 ) + e ^ - ( t - 2) ) / 3 ) - 4 / 3 e ^ - 4 ( t - 2 ) + 10 / 3 e ^ - ( t - 2 )

I have this code and to test if it works in TextField1 next to the label "MATRIZ A" I enter

I'd like Maple to see that the derivative of p1 with respect to X includes p1 and p2

> p1 := exp(a*x)/(exp(a*x)+exp(b*x)+1);

> p2 := exp(b*x)/(exp(a*x)+exp(b*x)+1);
> m := eval(diff(p1, x));
> n := expand(m);
I see that algsubs won't work along the lines of

   algsubs(exp(a*x)/(exp(a*x)+exp(b*x)+1)=p1,n)

because the substitution is not a polynomial.

any other way to do this?

Hi

I have the curve: f(x) = 1/x^3.

I want to find the coordinates of a point on this curve that is the nearest to the point P = (0,1)

How can I find this with Maple?

thanks, Anders

how to plot the second picture,for the area is that with abs

Does Maple have a command for return true or false when querying set membership of an element?

I have sets of random integers, Stuff[k], indexed by k, for example

Stuff[9]:={2,5,6}:

I need to be able to test if

7 is a member of Stuff[9]: // I should get false

5 is a member of Stuff[9]: // I should get true

There is no such set membership function listed in the Help menu.

I finally figured out a for loop for sequentially removing one set from another (set-theoretic subtraction).

Below is the code found on this site for generating the mandelbrot set.

with(ImageTools):

MyMandel := proc(pt)

local i,z,c;

c := pt;

if abs(c) > 2 then

return 1;

else

z := c;

for i from 2 to 100 do

z := z^2 + c;

if abs(z) > 2 then

return i;

end if;  end do:

return 0;

end if; end proc;

GenerateComplex := proc(pts,X1,X2,Y1,Y2)

option evalhf;

local X::Vector, Y::Vector, f1::Vector, Z::Vector;

Forgive my ignorance here but let say we have some data that I want to

model with some partial differential equations. What would be most efficient way

to come up with the specific equations inorder to be able to calibrate such system ?

I guess I could just calculate the partial elasticities and deduct some relationships from that

but there has to be a more beautiful approach ?!

Okay, I'm trying to solve a person's expected utility given a budget constraint using the Lagrangian method on Maple. I keep getting the error 'Warning, solutions may have been lost'

Here is what I have so far. Can anyone tell me what I'm doing wrong?

Z:=(EU+λ*(Px*X+Py*Y+f))

solve({diff(Z,X)=0,diff(Z,Y)=0,diff(Z,f)=0,diff(Z,λ)=0}.{X,Y,f,λ})

Download 7845_notes.pdf
View file details

Hi,

I am trying to go through an example in my notes.

p:=2038074743;
q:=1190494759;
n:=p*q;

x:=141213562373095048;

y:=Power(x,2) mod n;

then I do the following,

Power(y,(p+1)/4) mod p;