MaplePrimes Questions

A user asks what they're doing wrong in r/maplesoft with the attached screenshot:


How are constructed binary operators in Maple?
Is it possible to create a binary operator A that we can use this way z := x A y ?


hello I would like to ask how to implement phase singularities using wavelets in maple.

Hi respected members, `looking for the numerical solution of nonlinear ode after converting into the first-order ode by using shooting method with  Rk45 method for different value of beta `( less than 1)  and for a fixed value of p=2.

Good day all.

If I generate a list containing (say) 100 elements or more, and each element is an ordered pair - is it possible to assign a letter to each element? The first 26 elements will have equal A to Z, the next 26 will take A1 to Z1, and so on.

For example if the list is [ [5,3], [2,5], ..., [3,1]], how do I construct it to become [A=[5,3], B=[2,5], ..., V3=[3,1]]?

Please see attached.

Thank's a lot for your time.

Hi all,

I'm new to the Maple software, and have been having difficulty figuring out how to plot a 3-D figure for given xyz values. Could anyone provide any guidance on this? I've attached the relevant document to provide the specific values in case that would be helpful.





What am I doing wrong? Seems like some unit compatibility problem when tryaing to solve simple task with momentum conservation rule...

Automatically loading the Units[Simple] subpackage

m__2 := 0.400*Unit('kg');
m__1 := 0.300*Unit('kg');
x__w := 0.700*Unit('m');

v__2p := 0.000;

v__1p := 2*Unit(('m')/('s'));


m__1*v__1p + m__2*v__2p = m__1*v__1k + m__2*v__2k;
             0.6 = (0.3 v__1k + 0.4 v__2k) Unit|-|

subs(v__2p = 0, 0.600 = (0.300*v__1k + 0.400*v__2k)*Units[Unit](s/m));
             0.6 = (0.3 v__1k + 0.4 v__2k) Unit|-|

v__1k := solve(0.600 = (0.300*v__1k + 0.400*v__2k)*Units[Unit](s/m), v__1k);
           v__1k := (-1.333333333 v__2k + 2.) Unit|-|


1/2*m__1*v__1p^2 + 1/2*m__2*v__2p^2 = 1/2*m__1*v__1k^2 + 1/2*m__1*v__2k^2;

Error, (in Units:-Simple:-+) the following expressions imply incompatible dimensions: {.1500000000*(-1.333333333*v__2k+2.)^2*Units:-Unit(J)+.1500000000*Units:-Unit(kg)*v__2k^2}

Sitting and trying find solution in help and on forum but no chance.

I hope if someone copy code into maple it will look lik on my screen. Anyway I have uploaded file and below You have screen picture.

If I remove units from variables on the top all is working like a charm.

Please help me find an error guys.




I'm a student in calculus II.

What is name of the integration technique that Maple is using in the first step? This is a problem without a walkthrough in my textbook and while I got the same answer using integration by parts my solution looks different until the end because I didn't change the variables.





Good day. 

I am wrestling a simple network (maze-type) problem and I hope someone can assist.

Given a standard x-y framework with several nodes whose locations are known, I would like to visit each node by starting from the origin, (0,0), and returning to that same point, A. (see attached)

However, I am permitted only to move horizontally and vertically within the maze.

Given that restriction, is there a routine that allows me to visit all locations, B, C, D, and E, such that the rectilinear distance is a minimum?

If there is a solution to this problem, can the distance also be given and order of visits specified?

Thanks for reading!

I have created a simple piecewise function to represent the radius r(x) of a circular cylinder of length 2a and radius b with ellipsoidal end caps of length e << a and e << b to get a smooth transition of r(x) at the two ends for use in slender body theory. The piecewise function does not behave as I had expected, and this is the first time that I have used a piecewise function. What am I doing wrong? The attached (I hope) Maple worksheet shows both my expected behavior and the actual behaviort. Any help will be greatly appreciated. Thanks.

Neill Smith


how to draw these 3 lines and then project them on the plans Oxy,Oxz,Oyz;
3 given lines a := [3*t-7, -2*t+4, 3*t+4]; b := [m+1, 2*m-9, -m-12];c:={x = -200/29-2*t, y = 114/29+3*t, z = 119/29+4*t}, how to show these lines and the projections on the 3 planes ? Thank you.

I solve a system of equations, and am having difficulty 1) understanding what I"m seeing, 2) using the results.



At (21), I get the solution to the system of equations.  I then want to use substitute a value for xC1 that supports the solution, and plug it into the other variables that are solved in terms of it.  However, I can't figure out how to do this.  I keep getting errors like:

Error, invalid input: eval expects its 2nd argument, eqns, to be of type {integer, equation, set(equation)}, but received {Rsrc = .9640102828*xC1^2+0.2570694087e-2*(140625.*xC1^4-151321.*xC1^2)^(1/2), xC2 = -0.1333333333e-2*(281250.*xC1^3+750.*xC1*(140625.*xC1^4-151321.*xC1^2)^(1/2)+51018750.*xC1^2+136050.*(140625.*xC1^4-151321.*xC1^2)^(1/2)-151321.*xC1)/(375.*xC1^2+(140625.*xC1^4-151321.*xC1^2)^(1/2)), xC1 <= -363.3194071}

please see attached file.

I assume I'm getting 2 solutions.  I'm picking the first one and trying to then solve for the other variables once I pick a value for xC1.


Thank you,



I have a complex transfer function.  I've defined everyting as "real" via:

assum := Rsrc::real, C1::real, Lp::real, C2::real, f::real, RL::real, 0 < Rsrc, 0 < C1, 0 < Lp, 0 < C2, 0 < RL, 0 < f

I'm expecting simplify to reduce the following transfer function so that the denominator is real, but I can't get it to do it:

I have every variable defined as real, so I am not sure why it won't simplify this expression.


Thank you



Dear Users! Hope everything fine here. For any vales of M and N I generated the system of equation.

for j from 2 while j <= N do
for i while i <= M do

omega[2]*(2-b[1])*u[i, j]+(2*b[1]*omega[2]-b[2]*omega[2]-omega[2]+1)*u[i, j-1]-omega[2]*(sum((b[l+2]-2*b[l+1]+b[l])*u[i, j-l-1], l = 1 .. j-2))
end do end do

But I want to convert it into matrix for example if N = 3 and M = 4, I need the following form

I am waiting for your response.

Hello everyone !,

I would like to generate two random complex vectors (x1 and x2) several time and I want to check how these two vectors (j iteration) close to their previous values (j-1 iteration): abs (x1(j)-x1(j-1)) < 10^-4 and abs (x2(j)-x2(j-1)) < 10^-4. Therefore, I want that my program stop when this criteria is satisfied for x1 and x2 simultaneously.

I know how to check that for one element of the vector but not all the elements of the vector.

First 9 10 11 12 13 14 15 Last Page 11 of 2055