https://www.maplesoft.com/applications/view.aspx?SID=3589&view=html

Professor Robert J. Lopez is a Maple Fellow and the author of many Maple webinars and applications. He is also co-author of a book entitled Discovering Calculus With Maple, which I have recently acquired, and which turns out to be keyed to Maple V Release 3 on a Mac. Well, I have Maple 2020 on a Mac. What is the best way to get this book to work for me?  Thanks very much.

I've made calculation as array := function(array1,array2). Then summ of all array[i] all in one cycle. If I look in summ variable I see fu(0+fu() +.. agebraical representation. I tried evalf(summ). still algebraical. How to derive numerically?

can anyone tell me the difference between subs and eval and  evalf ?

Hello dear Maple,

My name is Bulat, I'm student of Kazan National Research Technical University ( Russia). In our High Program we used your product ( Maple V, Release 4). Now I have two problems and I haven't no idea how I resolve their. I am forced to ask for your help. I upload PrintScreen of my two problems. Please help me to solve them. I' ll be grateful for your help. Sorry for my English :(.

Yours very truly, Bulat

In Maple V, Release 4 (1996):

I receive this output:

N := 5000
Error, too many levels of recursion
3607
5001

Can You explain this occurence, as well as the following one:

In Maple V, Release 4 (1996):

gives:

N := 5000
Error, too many levels of recursion
3607
Error, too many levels of recursion
3607

How does one control allowance for recursion depth?

How do I write a procedure to find a root of f(x)=0 in the vicinity of a given value x0. The procedure should initially use the rearrangement method to produce a linearly convergent sequence of values, and should, when appropriate, switch to Aitkin's Method. The input for the procedure should be the re-arranged function and the velue for x0. The output should be the root and the number of iteration taken. The procedure should check that re-arrangement will converge. This program should do in Maple V Release5.

Thank you for your help.

I am trying to obtain the splitting field of New_polyq. evala@AFactor did not complete. Applying splitting sequentially produced independent extensions from the first 2 (3?) factors. evala@Indep did not complete for the union of all 4 extensions.

What libraries would handle this better?

restart; _EnvExplicit:=false;interface(labelwidth=200);
Rho_polys:=rho[3,1]^3-2, rho[3,2]^2+rho[3,2]*rho[3,1]+rho[3,1]^2, 2*rho[6,1]^3+rho[6,1]^6-2, rho[12,1]^2+rho[6,1]^2-1, 2*rho[12,2]^2-rho[6,1]^2*rho[3,2]*rho[3,1]^2-2*rho[6,1]^2-2;
New_poly:=1/16*(-rho[6,1]^4*rho[3,2]*rho[3,1]-2-rho[3,1]^2*rho[6,1]^4-2*rho[6,1]*rho[3,2]*rho[3,1]-2*rho[3,1]^2*rho[6,1]+2*lambda^2)*(rho[6,1]^4*rho[3,2]*rho[3,1]+2*rho[6,1]*rho[3,2]*rho[3,1]-2+2*lambda^2)*(-2+2*rho[3,1]^2*rho[6,1]+rho[3,1]^2*rho[6,1]^4+2*lambda^2)*(-2+rho[6,1]^2*rho[3,2]*rho[3,1]^2+2*lambda^2);
sol:=solve({Rho_polys});
alias(op(sol));
New_polyq:=subs(sol,New_poly);