In the unrelated discussion https://mapleprimes.com/questions/222768-Interrupting-An-Evaluation-Leaves-Mserver-Running
I asked Carl Love if he had an estimate of the number of builtin procedures in Maple.
Carl answered with the code you will find in the link.
His code came up with 316 and 320 in Maple 2016.2 and 2017.2, respectively.
He mentioned that the last one alphabetically was zip.
I happened to look up the help page for type/builtin and found the statement:

"It may be used with anames to list all builtin procedures. For example anames(builtin)."

So I tried:

AB:={anames(builtin)};
nops(AB); # 234 in Maple 2017.2
member(zip,AB); #false
op(3,eval(zip)); # builtin = 589 in Maple 2017.2
showstat(zip); # Works despite being builtin.

In Maple 2016.2 the corresponding numbers were 232 and 585.
So I'm left somewhat confused.
Apparently some procedures are less builtin than others? Does this just mean that the most difficult zipping is builtin, while simple stuff like the following is done by line 16 in the available code for zip?

showstat(zip,16..17);
zip(`=`,[a,b,c], [1,2,3]);

I have saved 3 Maple workbook files on my computer, but only one of them can re-open.
when i try to open the other two a pop-up says

"A problem was ecountered while opening the workbook.

database is not opened" 

and then i get the option to press "ok". What should i do?

If I enter the following I do not get the residue... how do I make the residue command work?

f := (z, t) -> ln(t)^2/((t^2+1)*(t-z));

int(f(z, t), t = 0 .. infinity) assuming Im(z) > 0;
       int(ln(t)^2/((t^2+1)*(t-z)), t = 0 .. infinity)

int(f(a + I*b, t), t = 0 .. infinity) assuming a::real, b > 0; # 0*infinity
       -sqrt(a^2+b^2-2*b+1)*signum(I*arctan(b, a)-I*arctan(-b, -a)-I*Pi)*
       infinity/((I*b-I+a)*(I*b+I+a))

int(f(z, t), t = 0 .. infinity) assuming Re(z) > 0, Im(z) > 0;
       int(ln(t)^2/((t^2+1)*(t-z)), t = 0 .. infinity)

int(f(a + I*b, t), t = 0 .. infinity) assuming a > 0, b > 0;
      -((3*I)*Pi^3*b+3*Pi^3*a-(16*I)*Pi^2*arctan(b/a)-(6*I)*Pi*ln(a^2+b^2)^2+(24*I)*
      Pi*arctan(b/a)^2+(6*I)*ln(a^2+b^2)^2*arctan(b/a)-(8*I)*arctan(b/a)^3-8*Pi^2*
      ln(a^2+b^2)+24*Pi*ln(a^2+b^2)*arctan(b/a)+ln(a^2+b^2)^3-12*ln(a^2+b^2)*
      arctan(b/a)^2)/(24*(-b^2+(2*I)*a*b+a^2+1))

So it looks like the first three can be made to work as well (and the result in terms of z will be much neater).

Hello every body

I have a plot that contains two curve. I need to chracterize the curves with `min(D_{T})` and `max(D_{E})`. Is it possible to write legend of plot such that when include it in latex file,  T and E be presented in indices?

"The account type or email address or password is incorrect."

None of those things is true. Using those same credentials, I am able to log in to Maple Cloud in my office but not from home. 

Has anyone else had this problem or know of a solution?

Thanks!

Running Maple 2017 in office on Windows 7 and at home on Windows 10.

Office copy is through a site license purchased by my university. Home copy is a personal home-use copy obtained through the Maple Adoption program.

I am attempting to build a text field at the bottom of this worksheet MathApps-ResistorsMark.mw  that asks users for the resistance.

I am hoping to have the value of the text field evaluated using the Module() at the bottom of the startup code, for use as a question within MapleTA.  For some reason I can get the code to work for a slider, but not a textbox.

I have limited knowledge about startup code.

Notice: I will be removing the resistance from the diagram for students after I know it works.

I appreciate any help that can be offered.

Dear Maple users,

I am solving a system of linear equations Ax=b where A is a matrix (243*241) which contains a rational polynomial of unknown "kappa" along with floating numbers. As suggested in some other posts I am using Linear algebra package with the LinearSolve command and option "solve" to find out unknown vector x. b is a vector having entries zero and 1. The system is such that two equations are redundant but it is difficult to recognise which two are redundant and hence for the time being I am keeping them in the matrix. (For a known value of kappa (say kappa=2) I have checked that two equations are redundant.) For the reference, the matrix and the right-hand vector b is attached as text.

There are two issues

1) Maple takes very long time (12 hours and so) to get x=b\A;

2) The result is a long expression i.e.  x[i] is a rational polynomial in kappa; a very long rational polynomial which I am importing as a text. I am not sure if maple exports all terms in the polynomial as for the different value of kappa I see Ax-b >0. 

How can I overcome this problem? Any help will be greatly appreciated. 

ode1a := diff(y1(tt),tt) = round(rhs(odeparm1[1][1]))*y1(tt) + round(rhs(odeparm1[1][2]))*y2(tt) + round(rhs(odeparm1[1][3]))*y3(tt);
ode2a := diff(y2(tt),tt) = round(rhs(odeparm1[1][4]))*y1(tt) + round(rhs(odeparm1[1][5]))*y2(tt) + round(rhs(odeparm1[1][6]))*y3(tt);
ode3a := diff(y3(tt),tt) = round(rhs(odeparm1[1][7]))*y1(tt) + round(rhs(odeparm1[1][8]))*y2(tt) + round(rhs(odeparm1[1][9]))*y3(tt);
sys := subs(y3(tt)=1,[ode1a,ode2a]);
print(DEplot(sys, [y1(tt), y2(tt)], tt = 0 .. 16, y1 = -16 .. 16, y2 = -16 .. 16, color = magnitude, title = `Stable Limit Cycles`, arrows = curve, dirfield = 800, axes = none));

how to mirror the vector field graph mathematically?

mirror the graph about x=0 this line,

so that the graph looked flip

i find curl can do, but how to do ?

Hello everybody

I'm using discrete distributions from the Statistics package and I found a rather strange result.

In short the theoritical values of some statistics of a NegativeBinomial(1, P) Random Variable (P being the probability of success equal to 1e-4) are correctly computed, but their empirical estimators computed from a sample of this RV are roughly wrong.

For NegativeBinomial(1, P) is similar to Geometric(P) I asked Maple to compute the theoritical values of some statistics of Geometric(P) and next to assess their empirical values from a sample of Geometric(P).
Some discrepancies still remain but they can be explained by statistical fluctuations.

Could you please look to the attached file (an error on my part is still possible) and help me to fix this ?

Thanks in advance


PS : the histogram of Sample(NegativeBinomial(K, P), AnySizeYouWant) is obviously wrong (it should look like a decreasing exponential) 

Download NegativeBinomial.mw

I have encountered bug in factors/fsolve while working with 19-th degree polynomial: 

restart;

Digits:=150:
T:=-6.22380759047872668130713536877030256364968636070065651396334810246948704517800844289400608484048587112392332204805530128070851889819985512874202683743*10^11*x^15+1.30320674544020861155773378297484119553167774488351680864188235543008368581731239587845304516984389100205019741111280194189829856859808540642557769603*10^10*x^6-4.66269056752439302342961934783764679009596024511170531603537327397832302302620600217387943312388922053304167698527169182278585860427802821480352854136*10^11*x^9-2.23704996926446119043671514798254764988240075983626880645807120500701523185370168392321824617257975062292105400290171941856646211919772527234308968846*10^9*x^5+1.70227750800986164284793608409450414651109713000703213281475661248797845709368255736580952492853671050778821135335145407044800619189451776936359075686*10^12*x^12+2.75132914316444017343930750158891109941047127103886960894939389127711887329536485172215512793127850186551483171384960841607262449527761786758828223621*10^8*x^4-34932.1305741980482332724462824276603543110574918698909627427160477228536038554704823433224807581628905769847550345090785500099182662763447500819501675*x+1.14859089243616386902401277001127426741536679789632050800564282457083136981495352758127041512610195469873039580049988570650313838832989727748112868586*10^12*x^14-6.60479740997269404871863401649844958253760499264982628400515571200965556608668632440745621931354881132921476624343305820884923453724427367494415551238*10^10*x^17-5.62833694496139881587566825658979473046292640751330993837612787833792702707901920475562429114656627532669843830531312111426766840057855202536781521123*10^10*x^7-1.41317084251894030640575308228417182186337397538022537825365672333611503622567981167488384741420461775617951229535582868905095341476313150469092017698*10^12*x^11-8.21268191019727949807038061270674769712976810595535494085869238004490345847174711476348954310804852930678468602300916137608391140935636924900016951244*10^8*x^19+397.252699937115297695173788383107213691513398731729934944369484808586994493337920006396692649274392699364304534062337678482629861430643165733668575822+2.45061767631130714142188028061597642324588736935628490184983950396964320020866945354270367821778753632385377702112725604392839751008695021580743844404*10^11*x^16+1.08699947236093139248842860047684411564605736115175003178583710408973712475471303403438454553797809672473740940054172927497665894877177132800140413775*10^10*x^18+1.84485142971549353599220669614768264648023215439682851036030548807708252959822522849421648368214446092969270608024147362000126035954415744321702508798*10^11*x^8-2.30461084758765666852675422975553976835398815305842562217293737088819307979848024374022174488508670823626363788957243202121075401744096241597591787541*10^7*x^3+9.17691101238967627829517731270700894639677345422963842539705370480050031196020089039807157125184117990094461042715726886282973724309183151499484709563*10^11*x^10-1.59505142070054081045558935086478494555622632474984266672719416019069437321867830698450310020630535513817946854845186492455277659549284062382504657541*10^12*x^13+1.21399269842294123787022397507857250840398420627023248941081275489711499859955449395398103964932227544163416388726749227644470585060488880538430515276*10^6*x^2:

infolevel[fsolve]:=3:
fsolve(T,fulldigits); # <-- completes without issues

factors(T);           # <-- freezes with log:
fsolve: ill-conditioned polynom of degree 19, with 0(0) given roots
fsolve: 1th root found in 9 iters at 165 Digits
fsolve: 2th root found in 11 iters at 164 Digits
fsolve: 3th root found in 11 iters at 165 Digits
fsolve: 4th root found in 10 iters at 174 Digits
fsolve: 5th root found in 10 iters at 167 Digits
fsolve: 6th root found in 11 iters at 168 Digits
fsolve: 7th root found in 11 iters at 174 Digits
fsolve: 8th root found in 11 iters at 170 Digits
fsolve: 9th root found in 11 iters at 181 Digits
fsolve: 10th root found in 11 iters at 172 Digits
fsolve: 11th root found in 12 iters at 175 Digits
fsolve: 12th root found in 11 iters at 182 Digits
fsolve: 14th root found in 14 iters at 177 Digits
fsolve: 15th root found in 10 iters at 176 Digits
fsolve: 16th root found in 11 iters at 173 Digits
Warning,  computation interrupted

The most interesting thing is that standalone 'fsolve' finishes fine, but 'factors' freezes in 'fsolve:-polyill' on the same polynomial.

My system is: Windows 7 x64, Maple 2017.0.

Would appreciate any help on how to avoid the issue with 'factors'.

ode1a := diff(y1(tt), tt) = 1.342398800*10^5*y1(tt)+89591.20000*y2(tt)+44647.44000*y3(tt);
ode2a := diff(y2(tt), tt) = 89591.20000*y1(tt)+89803.24000*y2(tt)+44901.60000*y3(tt);
ode3a := diff(y3(tt), tt) = 44647.44000*y1(tt)+44901.60000*y2(tt)+44859.24000*y3(tt);

would like to find the origin eigenstate before it collapse to eigenvalues

how to apply ricci flow in this situation?

i find help file , and can not find some relationship between this application and inputs of ricci related function

which functions in maple can help to find origin of eigenstate

I have a few "regular practices" on the interface that i want to implement into conjecturing automata, and i would really really be super appreciative if i can interface it with simon's/maplsoft's inverse symbollic calculator, the only problem really is  the HTTP aspect is going  to ( im assuming) need certain information only known to the people who brought the symbolliic calc online. So thats my  question / request for help

Hi all!

I am using the solve command for solving 200 equations (linear in 200 unknowns) symbolically. The solve command computes efficiently for 50 equations, after which the efficiency decreases (RAM memory and computation issues).

Is there some other better way available to solve a system of algebraic equations symbolically?

thanks