Hi,

I’m not very familiar with how to handle complex numbers in Maple, but I’d like to solve a final exam exercise (June 2025) on complex numbers in this environment. I’ve already solved it using pen and paper. My goal is also to illustrate the different results graphically, for pedagogical purposes, so I’d like some guidance to translate my pen-and-paper solution.

Bac_25_SM_Complexes.mw

Epreuve_Bac_SM_2025_Ss1_Sol-Exo-02.pdf

I need to use a procedure where one of the parameters is a function. Conceptually, this seems straightforward, but I’m encountering unexpected behavior. Here’s a minimal example of my approach:

f1:=proc(t::numeric, fn::function)::numeric;
return fn(t+1)+1
end proc;

However, none of the following calls return the correct result:

f1(2, sin);
f1(2, sin());
f1(2, sin(x));
f1(2, u-> u^2);

Any guidance would be greatly appreciated!

we have a lot term which we add thus term we can get something near to our solution but i don't know how it is work , did any one did pade approximate of series solution?

Download pade-approximate.mw

Hi
I want to plot M versus R=kappa for the mentioned parameters. (I know M must be a real and positive number)
But I couldn't. May someone please review and fix my uploaded file?

m1.mw

It is very strange, but I cannot find in v. 2025 shortcut or a button for stoping current evaluation.

I had no problem with this in previous version, but now the absence of immediate stoping make troubles for me,

what is the problem in the integral calculation ?

integral.mw

Download integral.mw

Find the circle of maximum radius that is tangent to both curves. 
There are no other conditions or restrictions.
Equations of curves

 (x1-1/2)^4+x1*x2+2*x2^2-1=0; 
 (x1-sin(x1))^2+(x2-sin(x2))^2-1=0;

The link below goes to the Proceedings of the Maple 2024 Conference, which includes several articles that will be of interest to the readers of Maple Primes.

There may be one more paper coming in to the proceedings later as per policy; since most things are ready, away we go!

Proceedings of the Maple 2024 Conferenc

(1) The gray line above the working area is redundant.

(2) Line Style, Color, and the "Delete" key function to delete object are not working properly.

(3) IdentifySequence([1,3,5,7,9]) without the second argument does not work.

(4) IdentifySequence should first identify simple patterns (Arithmetic Progression, Geometric Progression, Arithmetic-Geometric Progression, Harmonic Progression) before attempting to find a more complex formula for the nth term of the sequence.

(5) It would be beneficial if IdentifySequence recognized sequences involving rational, irrational and symbolic numbers.

I seem to recall that a[k] and a(k) are treated interchangeably within a proc.  But I did not expect that to happen at the top level.  See the worksheet below.  Is there a way to keep indexed quantities as indexed?

Download mw.mw

I have created an animation of a flexible octahedron (following Bricard) with Maple.   It shows the six vertices and twelve edges.  How do I add the faces (triangles)?  Can the animation show their lines of intersection?

It is not difficult to manually check the validity of the identity  sqrt(x+2*sqrt(x-1)) = sqrt(x-1)+1 , which is true at least for all  x>=1 . I don't know of any Maple command that directly makes this simplification:

expr:=sqrt(x+2*sqrt(x-1));
simplify(expr);
simplify(expr) assuming x>=1;

It was possible to simplify it only by making a variable substitution  x=y+1 (and then a reverse substitution  y=x-1 ) :

expr1:=subs(x=y+1,expr);
simplify(expr1);
subs(y=x-1, %);

By the way,  the CAS Mathematica also cannot cope with simplifying the expression  expr .

I'm working on an optimization problem involving a single decision variable p1, subject to four inequality constraints:

• Two upper bound constraints:

  p1 < b1,p1 < b2

• Two lower bound constraints:

  c1 ≤ p1,c2 ≤ p1

Effectively, the feasible region for p1 is:

max⁡(c1,c2)  ≤  p1  ≤  min⁡(b1,b2)

I have already formulated the Karush-Kuhn-Tucker (KKT) conditions for this setup, and now I'm trying to determine:

1. The optimal value p1∗​

2. The corresponding feasibility conditions

3. A case-wise breakdown depending on which constraints are active or inactive

Sheet:  Q_P1_Optimum_condition.mw

in this substitution really is hard to substitute which i don't have idea how find u[1]  u[2] so on becuase  in that term some function like u[i,x] appear and i don't have idea how define them to remove it in my iteration ? and how remove the conjugate of function u[0] i did try evalc(u[0]) and make it worst than this 

which i did some special substitution which i don't know true or not but result is true i didn't have other idea for that
which  instead of any conjugate i use v and istead of any diff(u,x) i use z[i,x] and if conjugate have derivative v[i,x]

k4.mw

Hello,

I need to sort a list of monomials in a custom order based on two criteria:

1. Increasing total degree (e.g., x<x^2)

2. Lexicographic order within the same degree, using a specified variable order such as x<y<z.

For example, given the list:

L := [z^2, y*z, x*z, z, y^2, x*y, y, x^2, x, 1] 

and the variable order (which can be changed by the user):

vars := [x, y, z]; 

I would like the output to be:

[1, x, y, z, x^2, x*x, x*y, x*z, y^2, y*z, z^2]

Is there a built-in function or a recommended way to achieve this in Maple?

Thank you!