MaplePrimes Questions

Search Questions:

Latest Questions Latest Questions Feed

Can you tell me the signification of the number 5 in output below.

Input: maximize(x^2+3,x=-1..2,location)

Output: 7,{[{x=2},5]}




how can solve using assume option ?





solve(F(z),z assuming -0.5<m<0.5, 0<u<0.5)

Error, `<` unexpected





This sequence has a special name does anyone know what it is? i mean id look it up on oeis but unfortunately the asthetics of their presentation dont meet my strict standards, so yes i did work out an expression for it but if anyone knows the easiest in a singular expression.. very helpful right now.


1, 1, 2, 2, 3, 3, 4, 4, 5, 5

Dear all

Let q be  a real  different to one and for a fixed positive integer  n  given also 


Let x and y satisfies the condition

x*y -q*y*x=1

I will assume that the product is not commutative in all my computation

We would like to write the following function using only y

f(x,y)= x*y^n-q^n*y^n*x


all computation done I get f(x,y)=(q^n-1)/(q-1)*y^(n-1)

But how can I get the same result using Maple

Thank you very much for any help








Im trying to copy my collegues work, he uses mathcad and I use maple. I have a problem when trying to solve a system of 7 equations and 7 unknows. For some reason he dosent seem to get the same problem of "Error, recursive assignment".

You can see a screen shot of his solution here:


And you can see my solution here:


As you can see the code dosent work, is there anyone that could help me understand why eactly this happens and how to fix this? 


Best Regards

Ivan N



Could someone please explain to me why the procedure GraphTheory:-CycleBasis requires that the vertices of a graph be integers for it to work correctly ?
(while the definition of a graph supports other types of vertex names)


#------------------------------------------------------- test 1

g1 := Graph({{"a", 1}, {1, 3}, {"a", 3}});

Error, (in GraphTheory:-CycleBasis) cannot determine if this expression is true or false: "a" < 1

#------------------------------------------------------- test 2

g2 := Graph({{a, 1}, {1, 3}, {a, 3}});

Error, (in GraphTheory:-CycleBasis) cannot determine if this expression is true or false: a < 1


#------------------------------------------------------- test 3

g3 := Graph({{4, 1}, {1, 3}, {4, 3}});

[[1, 3, 4]]

Knowing this limitation I usually rename to integers the vertices of the graphs, next do some operations, and next go back to the original names.

Thanks for any explanation.

Hy Prof.

Please help me or guide me to get idea to solve Nonlinear coupled PDEwith MAPLE.Dr.Sam Dao could please help me as I saw your YOUTUBE lecturer which very helpful to me and please give some idea about my topic.

pde[1] := diff(u(x, t), t)-D(diff(u(x, t), x, x)) = alpha*u(x, t)*(1-v(x, t))

pde[2] := diff(v(x, t), t)-E(diff(v(x, t), x, x)) = beta*v(x, t)*(1-u(x, t))

Thanks in advance and answer is highly appricaited 


I have to draw a couple of graphs in Maple 2016. Certain subgraphs must be highlighted and the commands

HighlightEdges() and HighlightSubgraph() are very useful. It seems to me however, that while I can choose the color

of any given edge, it is not possible to change the style or the thickness of the edge. All the edges in my graphs are straight l

ine segments but I do not know if it is possible to have a different style than solid, and/or a different thickness for that matter.

Ideally, I would like to be able to draw certain edges as dot, or dash, or any other options that are available for regular


Does anybody know if this can be done, and if it is possible, how should I do it.





digit := 15;
F[0] := fw;
F[1] := delta*F[2]+epsilon;
F[2] := A;
T[0] := B;
T[1] := -1;
a := 0.01;
m := 1;
M := 1;
lambda := 1;
b := 1;

fw := 1;
epsilon := 1;
delta := 1;
Pr := 6;
Ec := 1;
R := 1;
for k from 0 to 7 do F[k+3] := (a*(sum((i+1)*(i+2)*F[i+2]*(k-i+1)*T[k-i+1], i = 0 .. k))-m(1+a*T[k]-(sum((i+1)*F[i+1]*(k-i+1)*F[k-i+1], i = 0 .. k))+a*(sum(sum(T[i]*(r-i+1)*F[r-i+1]*(k-r+1)*F[k-r+1], i = 0 .. r), r = 0 .. k)))-M*(1-(k+1)*F[k+1]+a*T[k]-a*(sum(T[i]*(k-i+1)*F[k-i+1], i = 0 .. k)))-((m+1)*(1/2))*(sum((i+1)*(i+2)*F[i+2]*F[k-i], i = 0 .. k)+a*(sum(sum(T[i]*F[k-r]*(r-i+1)*(r-i+2)*F[r-i+2], i = 0 .. r), r = 0 .. k)))-lambda*(T[k]+a*(sum(T[i]*T[k-i], i = 0 .. k))))/((k+1)*(k+2)*(k+3)); T[k+2] := (-(1+b/Pr)*(k+1)*T[k+1]-b*(sum(T[i]*(k-i+1)*T[k-i+1], i = 0 .. k))-M*Ec*(1-(2*(k+1))*(k+2)*F[k+2])-Ec*(1+M)*(sum((i+1)*(i+2)*F[i+2]*(k-i+1)*(k-i+2)*F[k-i+2], i = 0 .. k))-(1-2*m)*(sum(T[i]*(k-i+1)*F[k-i+1], i = 0 .. k))-((m+1)*(1/2))*(sum(F[i]*(k-i+1)*T[k-i+1], i = 0 .. k)))/((4/3)*R*(k+1)*(k+2)) end do;
FF := sum(F[j]*y^j, j = 0 .. 5);
TT := sum(T[j]*y^j, j = 0 .. 5);
with(numapprox); pade(FF, y, [4, 4]);
pade(diff(FF, y), y, [4, 4]);
pade(TT, y, [4, 4]);
solve({limit(pade(TT, y, [4, 4]), y = infinity) = 0, limit(pade(diff(FF, y), y, [4, 4]), y = infinity) = 1}, [A, B]);


i get these errors in basically all worksheets i write. whats the hardware/software limitations related to this kind of error ?

assuming its not the fault of the way i write code but since thats impossible i assumed that it must be a limit of either ide or computer

i have an example, u[t] = u[xx]^2+u[yy]^2+u[zz]^2 with subject to b.c. u[0](x,y,z,t):=2*sin(x)*sin(y)*sin(z)
i used adomian method to solve this P.D.E, but i failed to construct a code of 2D P.D.E.
kindly help me in this regard

Is there a maple routine or sequence of routines to minimize an energy functional (scalar energy with a function as an argument)?

I'd like to avoid applying calculus of variations/integration by parts by hand.

For example, I'm looking for something like:

E := int(diff(f(x),x)^2,x=0..1);
bc := f(0) = 0, f(1) = 1;

whose result would be:

       f(x) = x

Is there a way to use dsolve to do this?

Maple's online help pages render all of the inputs (and outputs) as fancy math (MathJax). I guess the assumption is that you're using the visual IDE. However, I only have access to a terminal with ASCII entry (e.g., via SSH).

How can I can convert the online help pages into something that I can enter directly via the command line?

For example, how do I convert the examples from the EulerLagrange help page into command line entry?

I'm looking for a procedural way or ideally a toggle "switch".

what do i call a homogenous  differential equation that is the linear sum of "N" differential of unique classification? ie, the implicit construction of a third homogenous differential by the summation of two known, is it the span of the solution sets of the first two or union? i prefer span because well that leaves the door open for multivariate differential basis definitions, non commutative groups like sets of square matrices and all of the other extra arousing subject content.


When I type sin(pi/2) the result is sin(pi/2) (not "1.0)

What should I do to get "1.0" instead of replicating the sin(pi/2) ?!

I mean why the expression contating "pi" can not being simplified?

Is there any solution to this problem?



3 4 5 6 7 8 9 Last Page 5 of 1348