in page 137 of an introduction to groebner bases

how to eliminate the redundant solution (y^2-x*z, 0, -x^2+y*w)

from 3 of them?
eliminate({y,y^2-x*z,-z}, {x, y, z, w});
eliminate({-x,0,y}, {x, y, z});
eliminate({w,-x^2+y*w,-x}, {x, y, z, w});

ma := allstructs(Permutation([1, 1, 1, 2, 2, 2, 3, 3, 3]), size = 3);

above is fast

but below is very slow.
ma2 := allstructs(Permutation(ma), size = 3);

just for all combinations of matrix , replicateM in haskell is the fastest.

in maple, ma2 := allstructs(Permutation(ma), size = 3); is very slow

What is the best source of learning maple for an abecedarian to become a professional?

Hi

I can't understand difference between plots!

Please expailn it.

Thanks.

plot({sqrt(x+2*sqrt(x-1))+sqrt(x-2*sqrt(x-1)), sqrt(x-2*sqrt(x-1)), sqrt(x+2*sqrt(x-1))}, x = -3 .. 3)

strange_behavior.mw

Edit. Replaced worksheet.

Hi,

I have a problem with the adaptive question designer: when I use the multiple choice question type then occasionally parts of the question environment appear multiple times in the text, duplicating each time I reopen the question to edit. This happens in particular if the answers are a bit longer (4-5 lines each). So far I couldn't figure out how to fix this, does anyone have a similar problem? 

Many thanks for your help!

Please help me to solve this integration

restart; with(LinearAlgebra); int(exp(-(ln(z/(snr*B^2))+4*sigma^2)^2/(32*sigma^2))*eta^2*(y/z)^((1/2)*eta^2-1)/(z*sqrt(32*Pi*sigma^2)*(2*sqrt(y*z))*(2*A[o]^(eta^2))), z, z = y/A[o]^2 .. infinity);

restart; with(LinearAlgebra); int(exp(-(ln(z/(snr*B^2))+4*sigma^2)^2/(32*sigma^2))*eta^2*(y/z)^((1/2)*eta^2-1)/(z*sqrt(32*Pi*sigma^2)*(2*sqrt(y*z))*(2*A[o]^(eta^2))), z, z = y/A[o]^2 .. infinity)

Maple 2015:

simplify(1-2*sin(x)^2);  gives 2*cos(x)^2-1

I looked at help trying to understand why Maple thinks 2*cos(x)^2-1 is simpler than 1-2*sin(x)^2 but did not see it. I was expecting to see cos(2*x) as a result.

Is there a place to understand more Maple's simplification rules other than the help page? http://www.maplesoft.com/support/help/maple/view.aspx?path=simplify%2fdetails

I need to show that the following expression,
a^3b-a^3c+a^3z+a^3x+a^3y-a^2bx+a^2by+a^2cx-a^2cy-a^2zx+a^2zy-a^2x^2+a^2y^2-abcz-abcx-aczx-acx^2+b^2c^2+2bc^2x+c^2x^2-b^2c-2bcx-cx^2,

is positive

given that:

1. a,b,c,x,y,z are positive real numbers

2. a>b+x

3. c<b+y

I know a priori that the expression is indeed positive, but I do not know how to show it, or how to use Maple to do it?

Specifically, how can I use Maple to **partially factorize** the expression in terms of the expressions a-b-x and c-b-y?

Thanks for any help.

Can anyone tell me what is going on in the following worksheet? 

Download indets.mw

I have created and saved a MAPLE module in an .mla archive. The module contains three procedures A, B, C, where

A calls, B and C.  

Once the module library has been loaded, A acccepts inputs and generates outputs.

Is it possible to create a MAPLE player worksheet which calls the module and share it with a Maple Player (only) user, so that they can then supply the inputs and observe the outputs from A using the Maple Player programme components?

Can anyone help?

MRB

Hi everybody:

I'm going to learn programming with maple 18, are there any good and new pdf files for learn it?

with regards...

Consider the following situation: I have a function f, say

f:=x -> 1+x^2/n;

I want to compute the composition of f with itself; e.g.

g:=f@@n;
eval(g(x),n=3);

So it appears eval does evaluate the threefold composition but not at n=3. Obviously I can wrap this example in a subs() or another eval to get the replacement done; but it is a bit curious and I wonder whether this behaviour is as designed or an "undocumented feature."

I ran across this when investigating whether or how to do the composition for an arbitrary n (so I can e.g. find the limit for n=infinity) and really wanted to ask about that, but I see that such a question was dealt with before by Joe Riel using rsolve so I'll see first how far that approach gets me. In my case the function will be a polynomial vector function with vectorial arguments, providing for some additional challenge.

Mac Dude.

for example

There is a Matrix A:=Matrix([[1,2,3],[4,5,6]]), which function can help me find if 4 is an entry of  this Matrix?

Hello,

From a simulation software, I obtain in a matlab file my differential equations in the following way :

C_p_e = C_state/C_c;
C_p_f = I_state/I_i;
R_p_e = R_r*C_p_f;
I_p_e = (Se_p_e-R_p_e)-C_p_e;

For theses expressions, I would like to do two operations :
1) Transform it into equations
2) Conduct substitutions so as to change the names of the variables with nicer names.

For this objectives, I could do with the following code:

restart;
eq1:=C_p_e = C_state/C_c;
eq2:=C_p_f = I_state/I_i;
eq3:=R_p_e = R_r*C_p_f;
eq4:=I_p_e = (Se_p_e-R_p_e)-C_p_e
allsubs:= proc(XX )
subs(C_p_e=fs(t),C_p_f=v(t),R_p_e=fd(t),I_p_e=fm(t),C_c=1/k,I_i=m,R_r=c,Se_p_e=fe(t),I_state=int(fm(t),t),C_state=int(v(t),t),XX)
end proc:
eq1_a:=allsubs(eq1);
eq2_a:=allsubs(eq2);
eq3_a:=allsubs(eq3);
eq4_a:=allsubs(eq4);

Now, I would like to automatisation the creation of the equations eq1, eq2, eq3, eq4. For the moment, to create these equations, I have done copy/ paste from matlab.

But, I would like to create these equations eq1, eq2, eq3, eq4 with a automative process from my matlab equations. The reason comes from the fact that I would like to make the same work on bigger system which are composed with numerous equations.

How can I create equations labeled eq1, ...eqn from a list of expressions from matlab ?

Thank you for your help