we have the following:
CM := MultiSeries:-series((c*e+c*e^2+c*e^3+c*e^4+O(e^5))^m, e)
CM := c^m*e^m+c*m*c^m*e^(1+m)/c+(1/2)*m*(2*c*c+c^2*m-c^2)*c^m*e^(2+m)/c^2+(1/6)*m*(6*c*c^2+6*c*c*c*m-6*c*c*c+c^3*m^2-3*c^3*m+2*c^3)*c^m*e^(3+m)/c^3+O(e^(4+m))
I am helping a friend.
Please see the two expressions that we would like to convert from Maple into Matlab:
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.
November 12 2009
Initial conditions, x(0)=2, D(x(0))= -2
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
because the substitution is not a polynomial.
any other way to do this?
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?
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
I need to be able to test if
7 is a member of Stuff: // I should get false
5 is a member of Stuff: // 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.
MyMandel := proc(pt)
c := pt;
if abs(c) > 2 then
z := c;
for i from 2 to 100 do
z := z^2 + c;
if abs(z) > 2 then
end if; end do:
end if; end proc;
GenerateComplex := proc(pts,X1,X2,Y1,Y2)
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?
How do I restart label in same page of maple worksheet mode. I wanted to label equation in consecutive sections numeric numbers, such as change the labels from 49.11...49.1.5 to 49.2.1.
View file details
I am trying to go through an example in my notes.
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