Hi everyone, I got a problem. I'm a new user and I'm getting to know this beautiful software.

The problem is that when I enter a function in math mode (the easyest with simple inputs I guess), once I right click and plot only the cartesian plot is shown, without the actual function. 

What should I try? Math without plots is boring... :)

Thank you!

Hello

I am new to Maple. I am solving the differential equation with the given initial condition. I am getting some error. Can anyone help me please.

Thanks

maple_help.mw

I have the following question:

Illustrate how the sequence N->R defined by n ->n^2/n^2 + 31n + 228 can be shown to be
within a given epsilon > 0 of its limiting value x0.
(a) use an appropriate conditional statement to find N such that abs (xn -􀀀 x0) < epsilon for every n>=N
and produce an appropriate list of the data points (n,xn) to illustrate
this

I found N but without using any CONDITIONAL STATEMENT.Can you help me find N using IF FOR WHILE?

Hello All,

I am running Maple 18 on Ubuntu 14.04.4 with x86_64 architecture. When running the xmaple command for a specific user, the java loading window takes about 5-10 minutes to appear. With other users, it takes around 15 seconds. All users are running the same xmaple script, I did not see and conflicting environment variables.

I was wondering if the community had any other ideas as to what could be causing this slow response?

Thank you in advance,

Michael

Hello,

I receive this message when I try to store the package that I have created as a table

Do you have some ideas how I can correct my code so as to store efficiently my package ?

Thanks a lot for your help

Consider the following:

conv1 := (x) -> eval(x, tau*f(t) = f(-t)):     # Using eval
conv2 := (x) -> algsubs(tau*f(t) = f(-t),x):   # Using algsubs
expr := Vector([
     tau*f(t),
   I*tau*f(t)
]);
conv1(expr),
conv2(expr);

I would have expected both components of expr to have been transformed, just as they do if algsubs is used, but the second component containing the imaginary unit I as well is not. Why not? Note that if I is replaced by any real number, then the substitution works quite as expected. Why should going from real to complex numbers change things fundamentally?

Additional note: Even though algsubs works above, I would like to avoid using it because the actual system I have contains more than a hundred substitutions to (potentially) be made, and algsubs can only take one at a time, in constrast to eval which in principle can take indefinitely (though finitely, of course) many at a time.

PS: In case the reader is wondering, tau is supposed to be a time reversal operator acting on some time-dependent function f(t).

I have an equation as shown below.  In this i need to get the value of 'a' for each 'omega'.  'omega' range from 0 to 2 with increment 0.01

And save all the values of 'a' as a column matrix named 'result'.

!!!  Please help  !!!

Download problem_1.mw

Hello,

In a worksheet, I have defined several long procedures. In order to simplify my worksheet, I would like define thes procedures in a package so as to call theses procedures from the package. It should enable to improve the readability of my worksheet.

However, i have never make a custom package. Can you detail me the main steps so as to create a custom package ?

Thanks a lot for your help.

I am interested in efficiently plotting a grid of squares where each square is coloured. 

From what I understand I can do this using plotting primitives. For example,

P1 := Array( 1..4, 1..2, [[0,0],[1,0],[1,1],[0,1]],storage=rectangular, order=C_order, datatype=float[8] );

P2 := Array( 1..4, 1..2, [[1,1],[2,1],[2,2],[1,2]],storage=rectangular, order=C_order, datatype=float[8] );

PLOT( POLYGONS(P1,P2), COLOUR(RGB,1,0,0,0,1,0)  );

plots one red and one green unit sqaure.

I am interested however in plotting millions of squares.  Is there a way to efficiently store the sequence required for the POLYGONS and COLOUR primitive?  Ideally I want to store them as arrays.

Dear All

Is there anybody who is working on contruction of optimal Lie algebra using Maple packages like DifferentialGeometry and LieAlgebra, I tried to find commands for constructing algebra in these packages but could not find such commands. I am sure these are only package that might help me. Following is Lie algebra whose optimal system is required:

Download Lie_Algebra_Classification.mwLie_Algebra_Classification.mw

Regards

Hello, guys

         I am a totally new comer in this erea. I get a new module file and want to implement it into maple,here is the link:

         http://cpc.cs.qub.ac.uk/summaries/ADWE

         After I downloaded the package, I didn't know the next step and I can't find a perfect solution to this case, maybe it is too easy.

         Can some cool guys can help me, THX.

The question in the title has been raised before over the years, but has maybe not received enough attention.
Reraising the question was motivated by a comment by Kitonum to a recent post on improved integration results in Maple 2016:
http://mapleprimes.com/maplesoftblog/202910-New-And-Improved-Integration-Results

Consider the following session.
restart;
assume(n=0);
n^2; #Returns n^2
eval(%);#Returns n^2
sin(n*Pi); # Returns 0
sin(n); # Returns sin(n)
eval(%); # Returns sin(n)
ln(n); #Returns ln(n)
ln(n*exp(1)); # Returns ln(n*exp(1))
expand(%); # Error, (in ln) numeric exception: division by zero
ln((n+1)*exp(1)); Returns ln((n+1)*exp(1))
expand(%); # Returns ln(n+1)+1
sqrt(n^2); # Returns 0
sqrt(n); # Returns n^(1/2)
eval(%,n=n^2); # Returns (n^2)^(1/2)
simplify(%); #Returns 0: simplify doesn't help in the examples above.
##################
We see that assume n=0 certainly doesn't imply that expressions always will be evaluated at n=0, but sometimes it appears that it does.
So what is the intended behavior when assuming equality?
##
Several years ago (Maple 14 or earlier) I overloaded assuming so that equality assumptions were handled by eval.
There was a discussion at the time in MaplePrimes about this. Shall try to find the link.

To check the point on the belonging to the segment I use the algorithm shown in the example. This is an example of intersection of the two segments in 2d. (We not check for parallelism.) We find the point of intersection of the corresponding lines and solve the equation f1 with respect to t and f2 with respect to tt. If 0 <= t <= 1, then the point belongs to the first segment, and if 0 <= tt <= 1 then the point belongs to the second segment.
(Similarly we can check point on the belonging to the segment in 3d.)
In the example point belongs to the second segment, but not the first. These segments do not intersect.
Question: Is there a function in Maple to find the intersection of the segments or to check on the belonging segment point, to make shorter?

segments_intersection.mw 

I mean

J := int((x^2+2*x+1+(3*x+1)*sqrt(x+ln(x)))/(x*sqrt(x+ln(x))*(x+sqrt(x+ln(x)))), x);

Of course, with Maple.

Dear ones.hello!
  I want to export a plot to a specified path but i dont want do enter it in plotsetup command.
For example:

plotsetup(bmp,plotoutput="F:/testplot.bmp",plotoptions="height=100,width=400");
plot(sin(x),x=-Pi..Pi);

exports the bmp file to a location already provided (bold one).
Is there a way to initiate save/browse windows instead of writing the adress of the location inside the plotsetup ?
I know how to do it in mathematica and i want a similar thing in maple