MaplePrimes Questions

Hello everyone!

Does anyone have an idea about the keyboard shortcut for right-clicking with a mouse? Strangely enough the standard context-menu key won't work in maple. Neither does shift+F10. I tried remapping this function to other keyboard keys but without any success so far...

Couldn't find anything about it in the manuals, maple help, google, etc.. It's such a frequent action, I just can't believe there is not a quicker alternative to grabbing the mouse, pointing it to what you are editing and right-clicking...

Many thanks in advance!!! :)

I have a fairly old laptop, a Toshiba S10 Tecra, windows 7 64 bit and 4 Gb RAM.  It has an NVidia Quadro NVS 150m video card inside and according to NVidia CUDA capable of a compute level to 1.1 which is ok for float[4] but not float[8].  Inititiating the computecabability in maple does indeed bring a score level of 1.1.

Doing any LinearAlgebra matrix calculations with CUDA enabled is maybe 5x's slower than with it disabled.  I run into BLAS errors and screen blankouts at matrix values of 2000.  The video driver is the latest from Toshiba (2010) but not NVidia (2014) I suppose there would be an increased performace with newer drivers but if I'm going to run into the same issue of slower calculations with CUDA enabled there's no point in even testing the newer drivers on an otherwise fine running machine. 

Since it is a low end video card is CUDA even worthwhile, will I even notice a speed up with updated drivers?


Dear Maple Experts,

i am new to maple and I am trying to write a maple algorithm in order to calculate the GCD of two functions. 

I have defined the two functions and written the algorithm, but I get an error "Unable to Parse".

Here is my code:

restart; with(Algebraic); with(LinearAlgebra[Generic]); with(RegularChains); with(FastArithmeticTools); with(ChainTools); interface(rtablesize = 15);

f := (y^2-1)*((y+1)*x^4+(y^2-1)*x^3+(y^3-1)*x^2+(y^4-1)*x+y^5-1);

g := (y-1)*x^5+(y^2-1)*x^4+(y^3-1)*x^3+(y^4-1)*x^2+(y^5-1)*x+y^6-1;

SubRes:=proc(f,g,var): local  i,a, delta, beta, psi: if degree(f,var)<degree(g,var) then a[0]:=Algebraic:-PrimitivePart(g,var): a[1]:=Algebraic:-PrimitivePart(f,var): else a[0]=Algebraic:-PrimitivePart(f,var): a[1]:=Algebraic:-PrimitivePart(g,var): fi: delta[0]:=degree(a[0],var)-degree(a[1],var): beta[2]:=(-1)^((delta[0]+1)): psi[2]:=-1: i:=1: while a[i]<>0 do a[i+1]:=(prem(a[i-1], a[i], var))/(beta[i+1]): delta[i]:=degree(a[i],var)-degree(a[i+1], var): i:=i+1: psi[i+1]:=((-lcoeff(a[i-1],var))^((delta[i-2])))*((psi[i])^((1-delta[i-2]))): beta[i+1]:=-lcoeff(a[i-1],var)*(psi[i+1])^((delta[i-1])): od: print("Last Non-Zero Subresultant: ", sort(simplify(a[i-1])),y): return (Algebraic:-PrimitivePart(a[i-1],var)): end proc

and I get this error:

Error, unable to parse

Would you kindly help me to fix this issue?

Kind Regards,




I am trying to figure out how to find several parital sums of the Airy's Function on a common screen. I figured out how to do it for a the Bessel fucntion of order 1, but I am not given the series for Airy's . Can anyone help me with what I would plug in to maple for the Airy's function or how I would go about finding the parital sums it would be greatly apperciated.



Dear Community,

Does anybody know, if there is a limit for the maximum number of equations for MapleSim? I tried with a system of 4456 equations, and I got the error message "(in DSN/RunSimulation ) system is inconsistent" When I took away most of the components (subsystems) it worked. So I suppose there must be some limit for the number of equations.

Tx in advance,


Hello, everybody!

If it is convenient for you, I wish you can help me review the following program. Thank you very much in advance. I want to obtain the coefficient values of c0, n, s0, ks, h1, h2, kp, A, B for the ODE system.

cdm_ode := diff(y1(t), t) = c0*(y6(t)*(1-y3(t))/(s0*(1-y4(t)*(1-y5(t)))))^n/(1-y2(t)), diff(y2(t), t) = ks*y2(t)^(1/3)*(1-y2(t)), diff(y3(t), t) = h1*(1-y3(t)/h2)*c0*(y6(t)*(1-y3(t))/(s0*(1-y4(t)*(1-y5(t)))))^n/(sigma*(1-y2(t))), diff(y4(t), t) = (1/3)*kp*(1-y4(t))^4, diff(y5(t), t) = A*B*y1(t)^(B-1)*c0*(y6(t)*(1-y3(t))/(s0*(1-y4(t)*(1-y5(t)))))^n/(1-y2(t)), diff(y6(t), t) = y6(t)*c0*(y6(t)*(1-y3(t))/(s0*(1-y4(t)*(1-y5(t)))))^n/(1-y2(t));

tol_t := 3600;

sol := dsolve([cdm_ode, y1(0) = 0, y2(0) = 0, y3(0) = 0, y4(0) = 0, y5(0) = 0, y6(0) = 175], numeric, range = 0 .. tol_t, output = listprocedure, parameters = [c0, n, sigma, s0, ks, h1, h2, kp, A, B]);

err := proc (c0, n, s0, ks, h1, h2, kp, A, B) local st1, st2, sv1, sv2, sv; sol(parameters = [c0, n, 175, s0, ks, h1, h2, kp, A, B]); st1 := subs(sol, y1(t)); sv1 := [st1(1), st1(100), st1(210), st1(2500), st1(2800), st1(3000)]; sol(parameters = [5.7/10^6, 10.186, 175, 200, 1/20000000, 10000, .269, 1.5/10^7, 1.5, 2]); st2 := subs(sol, y1(t)); sv2 := [st2(1), st2(100), st2(210), st2(2500), st2(2800), st2(3000)]; sv := add((sv1[i]-sv2[i])^2, i = 1 .. 6); sv end proc;

GlobalSolve(err, c0 = 0 .. 1, n = 1 .. 20, s0 = 150 .. 250, ks = 0 .. 1, h1 = 100 .. 15000, h2 = 0 .. .5, kp = 0 .. 1, A = .5 .. 2, B = 1 .. 5);

Error, (in GlobalOptimization:-GlobalSolve) `InertForms` does not evaluate to a module

Is there a Maple-function that returns a number of transpositions needed to transform a list into a list with some particular order? Actually, I need just a parity of a number of transpositions. All elements of a list are different.

For example, one needs 4 (even) transpositions to transform a list [w,x,y,z] into a list [y,x,z,w]:

Thank you

Please I need someone to help out with how to solve the below ODE numerically using finite difference method with the necessary maple code:


█( S〗_h〗^' (t)=Λ_h-αβ_m I_v S_h-μ_h S_h+πI_m,  

〖I_m〗^' (t)=αβ_m I_v S_h-(σ_m+π+μ_h ) I_m

〖 S〗_v〗^' (t)=Λ_v-αβ_v I_m S_v-μ_v S_v

〖I_v〗^' (t)=αβ_v I_m S_v-μ_v I_v )

The initial conditions can be assumed. Suppose i want to include controls, how do I solve the problem and equally plot the graph.


Thank you.



I tried with and without evalf. Do I need to import something? or something like with Linear Algebra? 

i am solving 3 ODE question with boundary condition. when i running the programm i got this error.. any one could help me please.. :)


restart; with(plots); k := .1; E := 1.0; Pr := 7.0; Ec := 1.0; p := 2.0; blt := 11.5

Eq1 := diff(f(eta), eta, eta, eta)+f(eta)*(diff(f(eta), eta, eta))+Gr*theta(eta)-k*(diff(f(eta), eta))+2*E*g(eta) = 0;

diff(diff(diff(f(eta), eta), eta), eta)+f(eta)*(diff(diff(f(eta), eta), eta))+Gr*theta(eta)-.1*(diff(f(eta), eta))+2.0*g(eta) = 0


Eq2 := diff(g(eta), eta, eta)+f(eta)*(diff(g(eta), eta))-k*g(eta)-2*E*(diff(f(eta), eta)) = 0;

diff(diff(g(eta), eta), eta)+f(eta)*(diff(g(eta), eta))-.1*g(eta)-2.0*(diff(f(eta), eta)) = 0


Eq3 := diff(theta(eta), eta, eta)+Pr*(diff(theta(eta), eta))*f(eta)+Pr*Ec*((diff(f(eta), eta, eta))^2+(diff(g(eta), eta))^2) = 0;

diff(diff(theta(eta), eta), eta)+7.0*(diff(theta(eta), eta))*f(eta)+7.00*(diff(diff(f(eta), eta), eta))^2+7.00*(diff(g(eta), eta))^2 = 0


bcs1 := f(0) = p, (D(f))(0) = 1, g(0) = 0, theta(0) = 1, theta(blt) = 0, (D(f))(blt) = 0, g(blt) = 0;

f(0) = 2.0, (D(f))(0) = 1, g(0) = 0, theta(0) = 1, theta(11.5) = 0, (D(f))(11.5) = 0, g(11.5) = 0


L := [10, 11, 12];

[10, 11, 12]


for k to 3 do R := dsolve(eval({Eq1, Eq2, Eq3, bcs1}, Gr = L[k]), [f(eta), g(eta), theta(eta)], numeric, output = listprocedure); Y || k := rhs(R[3]) end do

Error, (in dsolve/numeric/bvp) initial Newton iteration is not converging





plot([Y || (1 .. 3)], 0 .. 10, labels = [eta, (D(f))(eta)]);

Warning, unable to evaluate the functions to numeric values in the region; see the plotting command's help page to ensure the calling sequence is correct





Download tyera(a).mw

I'm using maple to write text to an external text file. My code is


f := x-> arcsin(x);

file := "C:\\example.txt":





The problem is that the output in my file example.txt reads "1/2*Pi" and I'd like it to be "1/2*pi". In other words, is it possible to have maple scan my file and replace the occurances of "Pi" with "pi"?

Is there a way to do the following on Maple:

I want Maple to use Jacobi's method to give an approximation of the solution to the following linear system, with a tolerance of 10^(-2) and with a maximum iteration count of 300.


The linear system is






First 1121 1122 1123 1124 1125 1126 1127 Last Page 1123 of 2195