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

If  we have two 1-dimensional arrays containing 'n' elements  each  and we want to compare the corresponding elements of the arrays (i.e., k th element of one array to the k th element of the other ). And the output that we are bothered about is that the corresponding element of both the arrays are equal (ie, one to one correspondence holds). Is there any simpler way to do this in maple. Somebody please help.

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;

how to find an expansion of: (we may assume m::posint)

(sum(a^k*b[k], k = 1 .. infinity))^m

for example: the trinomial theor...

(a+b+c)^m = sum((m,k1)*(m-k1,k2)*(m-k1-k2,k3)*c1^(k1)*c2^k2*c3^k3,k1+k2+k3=m)

here (m,k1) is the binomial coefficeitn

how to expand the following expression;

((1/6)*e*(6*(D(f))(gamma)+3*((D@@2)(f))(gamma)*e+((D@@3)(f))(gamma)*e^2))^m

Especially in old books (but not only there) the authors prefer the notion
of 'argument' ( = polar coordinates and using the angle).

Sometimes it comes to something like 

                | arg(-z) | < Pi and | arg(1 - z) | < Pi

which I prefer to have in terms of interval notation 'z in ... ' or its
complement  'not (z in .. )'.

I do not even know how to get | arg(z) | < Pi  <==> z is not a negative Real. 

How can I do it in Maple?