Assume the inequality x_A,2+x_B,2+x_C,2 ≤ 110 has to be entered as "symbolic entry only".

How can I check that in Maple T.A.?

It seems that there are type conversions necessary. I attempted to use the MathML package without any luck.

1. Tried to transform $ANSWER within the answer field using MathML[ExportPresentation]( x[A,2]+x[B,2]+x[C,2] <= 110) and compare it with evalb(($ANSWER)=($RESPONSE)) in the grading code field
2. Tried to transform $RESPONSE in the grading code: evalb(($ANSWER)=( MathML[ImportContent] ($RESPONSE)))

What’s the format of a symbolic entry? Is it really MathML!?

What is the correct way to do it?

1. answer: ?
2. grading code: ?
3. expression type: Maple syntax?!
4. Text/Symbolic entry: Symbolic entry only

Dear Collegues

I have a system of odes as follows

restart:
#gama1:=0.2:

#rhop:=5180:
#rhobf:=998.2:
#a[mu1]:=39.11:
#b[mu1]:=533.9:
#a[k1]:=7.47:
#b[k1]:=0:

Teq := N_bt*T(eta)^2*(exp(-(T(eta)-1)/(N_bt*(1+gama1)*(1+gama1*T(eta)))))^2*(diff(T(eta), eta, eta))*gama1^2*b[k1]+N_bt*T(eta)^2*exp(-(T(eta)-1)/(N_bt*(1+gama1)*(1+gama1*T(eta))))*(diff(T(eta), eta, eta))*gama1^2*a[k1]+2*N_bt*T(eta)*(exp(-(T(eta)-1)/(N_bt*(1+gama1)*(1+gama1*T(eta)))))^2*(diff(T(eta), eta, eta))*gama1*b[k1]+N_bt*T(eta)^2*(diff(T(eta), eta, eta))*gama1^2;


UEQ:=(a[mu1]*(-(diff(T(eta), eta))/(N_bt*(1+gama1)*(1+gama1*T(eta)))+(T(eta)-1)*gama1*(diff(T(eta), eta))/(N_bt*(1+gama1)*(1+gama1*T(eta))^2))*exp(-(T(eta)-1)/(N_bt*(1+gama1)*(1+gama1*T(eta))))+2*b[mu1]*(exp(-(T(eta)-1)/(N_bt*(1+gama1)*(1+gama1*T(eta)))))^2*(-(diff(T(eta), eta))/(N_bt*(1+gama1)*(1+gama1*T(eta)))+(T(eta)-1)*gama1*(diff(T(eta), eta))/(N_bt*(1+gama1)*(1+gama1*T(eta))^2)))*(diff(u(eta), eta))+(1+a[mu1]*exp(-(T(eta)-1)/(N_bt*(1+gama1)*(1+gama1*T(eta))))+b[mu1]*(exp(-(T(eta)-1)/(N_bt*(1+gama1)*(1+gama1*T(eta)))))^2)*(diff(u(eta), eta, eta))+1-exp(-(T(eta)-1)/(N_bt*(1+gama1)*(1+gama1*T(eta))))+exp(-(T(eta)-1)/(N_bt*(1+gama1)*(1+gama1*T(eta))))*rhop/rhobf;

I want to solve them with the following boundary conditions

T(0)=0, T(1)=1

u(0)=L*D(u)(0), D(u)(1)=0

However I tried, I cannot find the solution in a closed form. I want to know that is there a closed form solution for the above odes?

Thank you

Amir

Hi I am not very used to Maple since I used mathematica previously.

So is there way to put an if statement within sequecne definition? that is,

id = 1;

seq(if(i>2, idx += 1), idx+i , i=1..10)

something like this where if statement runs and then idx+i is added to the sequence, as if I am running a loop.

Thanks

1.

with(RegularChains):
with(ConstructibleSetTools):
source1 := PolynomialRing([a,b,c]);
target1 := PolynomialRing([e1,e2,e3,e4]);
source1list := [eq2a, eq3a,eq4a];
target1list := [eq2b, eq3b, eq4b,eq5b];
cs := PolynomialMapPreimage(target1list, source1list, source1, target1);

Error, (in RegularChains:-ConstructibleSetTools:-PolynomialMapPreimage) number of map functions is different from number of variables in target space

in maple 15 do not have error, however now it has error for the code below

with(RegularChains): with(RegularChains): with(ConstructibleSetTools): 

source1 := PolynomialRing([e1, e2, e3]);
target1 := PolynomialRing([a, b, c]);
source1list := [-1*e1+2*e2+*e3, -1*e1+2*e2+*e3, -1*e1+2*e2+*e3];
target1list := [.....]; cs :=
PolynomialMapPreimage(target1list, source1list, source1, target1);

Error, invalid product/quotient

I'm trying to implement a function that gets list1 and list2 to return a list of permutations that permute list1 to list2. 

Is there any good way to do this? 

http://www.maplesoft.com/support/help/Maple/view.aspx?path=GroupTheory/SylowSubgroup

P2:=SylowSubgroup(2,G);

P2;

in above example, it can show a permutation group

G:=AlternatingGroup(5);

P2:=SylowSubgroup(3,G);

a permutation group on .... letters

but in some example such as above, it only show a statement a permutation group on .... letters

how to show what it is?

Hello;

I had Maple 2015.1 running. I did Tools->check for update. It said that there is an update available! then I did ok, go and update. Maple downloaded about 60 MB of stuff, asked me to close Maple to finish the update. I close Maple, and it finished the update with no problem.

When I open Maple, I still see it saying 2015.1, so what was the update for?  

It will be nice if Maple tells the users what the update is going to be for. Like saying something to the effect that version XX.XX is available or something. It just said update available.

How can one find what was updated, and why did the version number not get changed? Is there a log file or some command one can use that shows the updates made to current version one is using?

Help->About still says 2015.1, is it possible Maple update just forgot to change the version number? What is the current and latest version number of Maple?  

When I do check for update now, it says no update is available. So I must be running the latest version. But this what what I had before I updated?

    kernelopts(version)
    Maple 2015.1, X86 64 WINDOWS, Jun 3 2015, Build ID 1049007

I am on windows 7, 64 bits.

Assume you want to check that the following inequality was correctly derived:

x_A2+x_B2+x_C2 ≤ 110

How can I check that in Maple T.A.?

If I use a Maple-Graded questions, what must be in the answer field? x[A,2]+x[B,2]+x[C,2] <= 110 !?

What is the grading code?

The following commands show that I have an existing archive containing one procedure.

Why do I receive the error message when I try to save a second procedure to the same archive. The procedure I am trying to save has been executed within the same worksheet where I issue the savelib command.

> LibraryTools[ShowContents]("C:\\Program Files\\Maple 15\\Earl.mla");

LibraryTools[WriteMode]("C:\\Program Files\\Maple 15\\Earl.mla");

savelibname := "C:\\Program Files\\Maple 15\\Earl.mla";

savelib('CreateCircleVector');

[["RotateDisplay.m", [2015, 10, 1, 16, 3, 22], 41984, 655]]
[["C:\Program Files\Maple 15\Earl.mla", "WRITABLE"]]
"C:\Program Files\Maple 15\Earl.mla"

Error, cannot lock repository, C:\Program Files\Maple 15\Earl.mla

Hi guys,

i want to find d'alembertian of a function of Ricci scalar (f(R)) , but it seems something is wrong .

f(R).mw

thanks in advance

How do you check an indexed variable in Maple TA?

For instance the question might be: enter 6x₁   (or 6x_A1)

I have tried using a Maple-graded question specifying as correct answer 6*x[1]   (or 6*x[A,1]) without any success (works only for 6x).

i have an application of emmbeded components i will like to know if i can create a stand alone exececutable using maple player

Dear all,

I need you help to finish some steps of this idea to approximate the roots of a given equation (polynom). Thanks in advance for your help. 

I have a sturm sequence, I would like to use Bisection method to approximation the roots using Sturm decomposition of my polynom. For example, my polynom is  P=x^6-4*x^3+x-2

s := sturmseq(x^6-4*x^3+x-2,x);

sturm(s,x,-2,2); # The number of roots in the interval (-2,2)

Here, i would like to find the roots in (-M,M) :

Bounding all roots in [-M,M] where M = max{1, sum^(n-1) |ai|/an}.

f0 = f, f1 = f', then use -remainder,

I know that  sturm(s,x,-M,M); gives the number of roots in (-M,M)  but is it possible to use the variation of sign like :

      gives a Sturm sequence for f.

      variation of sign, varsign(a0,a1,...,ar).

      Thm: (Sturm) varsign(f0(alpha),...,fr(alpha)) - varsign(f0(beta),..., fr(beta))

      is the number of distinct roots of f in [alpha,beta].

then i would like Isolating roots of rational polynomials

Method: reduce, remove rational roots, divide and conquer in [-M,M],

      then use bisection  in disjoint closed intervals ctg one root each

 Bisection method :

Bisection

      Setup: f(a) < 0, f(b) > 0 (or conversely).

      Repeated subdivision of [a,b] guaranteed to get close to a root.

      Error analysis: for error eps, solve (b-a)/ 2^(n+1)  < tol for n. where tol is the tolerance

Thanks

Which of Maple commands is better for computing the radical of a polynomial f (less time of computation and less complexity)?

For example if f=x^3+3x^2y+3xy^2+y^3 then rad(f)=x+y.

in harmonic ocillator version, why it has error after it dsolve?

with(Physics[Vectors]):
with(SumTools):
Setup(mathematicalnotation = true):

Qs is Qss*cos(m*t+phi);

H := 1/(8*Pi*c^2)*Summation(Commutator(diff(Qs*cos(w*t+phi),t)*diff(conjugate(Qs*cos(w*t+phi)),t)+w^2*Qs*cos(w*t+phi)*conjugate(Qs*cos(w*t+phi))),ks=1..3)-1/c*(Summation(conjugate(Qs*cos(w*t+phi)),ks=1..3));

or

H := 1/(8*Pi*c^2)*Summation(Commutator(diff(Qs,t)*diff(conjugate(Qs),t)+w^2*Qs*conjugate(Qs)),ks=1..3);

#Qs = p, Ps := Pss*sin(m*t+phi) Ps = qs

i use

H := 1/(8*Pi*c^2)*Summation(Commutator(diff(Qs*cos(w*t+phi),t)*diff(conjugate(Qs*cos(w*t+phi)),t)+w^2*Qs*cos(w*t+phi)*conjugate(Qs*cos(w*t+phi))),ks=1..3)-1/c*(Summation(conjugate(Qs*cos(w*t+phi)),ks=1..3));

 HJ := subs(Qs= diff(f(q,P,t), q), H);

H:=subs( f(q,P,t) = f1(q) + f2(t), HJ);
sol:=dsolve({rhs(H)=E,lhs(H)=E});
S:=rhs(sol[1][1]+sol[1][2]);
p:=diff(S,q);
Q:=diff(S,E);