Do not understand the answer to this.. eq1:=X=(1/Rp/(1/Rp/Rp+w*w*Cp*Cp)); eq2:=Y=(w*Cp/(1/Rp/Rp+w*w*Cp*Cp)+1/w/A/Cp); expand(solve({eq1,eq2},{Rp,Cp})); {Cp = RootOf(A+1+(-Y*A-2*Y)*_Z+(X^2+Y^2)*_Z^2,label = _L2)/A/w, Rp = -X*A/(Y*RootOf(A+1+(-Y*A-2*Y)*_Z+(X^2+Y^2)*_Z^2,label = _L2)-A-1)} What are the: _Z _Z^2 ? and what is the label = _L2 ? Can I make the answer look like somthing more understandable?

We are pleased to announce the first winners of the monthly Maple Mentors Awards. Jacques Carette and Robert Israel will receive a prize of their choice to thank them for their involvement with the MaplePrimes community. Jacques has consistently been a valuable member of MaplePrimes, posting clear and insightful information on advanced topics. Robert in particular has been active in the Student Forums on MaplePrimes since their inception and we would like to recognize this. One member had these comments on the two:

Hi, I am not proficient in Maple, I start to use it one week ago, but it already help me to solve problem that is unimaginable to solve for me by hand. Unfortunately, I encounter a problem which I am unable to solve by myself. I have written a simple function calculating Taylor expansion of two functions and then calculate some statistics of coefficients. Strangely, if I call the function twice consecutively, it always returns me different results. I tried to save intermediate results, but it is even more weird. The input is the same, but then in the middle of iterations results starts to differ. I am desperate.

Hi, I ran into this in my Modern Algebra class; and decided it might be of interest. We were given the problem to: "Find the least prime p s.t. 2^(p-1) congruent to 1 (mod p^2)" EVERY prime p > 2 has the property, 2^(p-1) congruent to 1 (mod p), by Fermat's Theorem (since 2 does not divide such prime p). But, mod p^2 is another story. This was given in a class where everything is done by hand calculation, based on theorems. I couldn't come up with any way to determine it other than brute force. Here is a tiny Maple snippet which finds it:

First, the shortcoming: Open a new Maple worksheet (I always work in Worksheet mode, so I haven't tested what happens in Document mode), and type anything in 2D Math Input into a line but do not execute that line. Save the file, then open it in a text editor or word processor. If you scroll down to the line containing the information for what you just typed in, you will notice that the attribute "input-equation" will be null; that is, it should say input-equation="" Even though there is input on the line, Maple doesn't add anything to the "input-equation" attribute until the commands are executed.

Some of the most significant members of Maplesoft’s math team are interviewed in this episode: Dr. Juergen Gerhard, Dr. Edgardo Cheb-Terrab and Dr. Allan Wittkopf, who give an inside look at just what is involved in designing and building sophisticated algorithms for advanced mathematics. They discuss symbolic computation, the new Physics package in Maple 11, Maple's DE and DAE solvers, future developments, and ballroom dancing.

I would like to use OpenMaple from VBA. I seem to have no trouble starting Maple from VBA, but I cannot sucessfully make any other function call - the application hosting VBA will immediately crash on the call. My hunch is that there is some sort of memory violation issue with the callbacks, but I'm not sure. Should I make modifications to the header files? Has anyone sucessfully used OpenMaple from VBA, for example with excel? Thanks in advance

I had a question regarding importing NURBS geometry into Maple with a complete R^2 -> R^3 definition of the underlying surface function. Im currently modeling in some CAD software and would like to use Maple for some surface analysis. I can save the surfaces as STEP or IGES, for example. As far as I know there is not a STEP or IGES import for maple, so I have been writing one of my own. However, this also requires getting some NURBS libs for Maple (which I have found), and in general it is a little complex. Is there a better way to get NURBS geometry into maple? Thanks in advance

The fact that animate uses subs when replacing the animation parameter with a number in the animation range can cause problems when the expression to be animated is only evaluated when the animation parameter is replaced by a numeric value. This is shown in the simple example below My suggestion is that in the procedure `plots/animate` the three subs's are replaced by eval's. Is there any problem with that? Preben Alsholm The following does not work at all, apparently because animate uses subs instead of eval in 3 places, lines 29, 43, and 64 (using showstat(`plots/animate`).

Should this post be allowed in this forum?

There has been quite a number of complaints about new version of Maple being somehow inferior to previous versions in various ways. Lest people think that this is special to Maplesoft, PC World is running a story titled Before they Spoiled the Software, on various multimedia software that used to be better before it got seriously bloated. They also draw the reader's attention to sites like oldversion.com which specialize in archiving older versions of ``free'' software.

Students do the craziest things. This was an interesting bug to run into. The following lines all cause Maple 11 to lose connection with its kernel: solve( x-x = 0 ); solve( x-x = 1 ); solve( x-x = -1 ); Whereas, the following lines do not cause Maple 11 to lose connection with its kernel: solve( 1=0 ); solve( x-x+1 = 0 ); solve( x-x-1 = 0 ); solve( x=x+1 ); solve( (x-x)^2 = 0 ); solve( x-x = x ); This message has also been sent to support@maplesoft.com

What shall I do when I recieve an error message in Maple10 saying Maple was unable to allocate enough memory(for example as a result of computing a large determinant of 3 parameters(13*13 or even more)). Can Maple11 compute such a det?

Is there any any algorithm for computing large determinants of polynomials?

I'm trying to do symbiolic manipulations to define new procedures but I have trouble figuring out how to achieve my goal. The context is as follows: We have a set of ODEs df/dt = R(f(t)) where f(0) = x. Here f and x are n-dimensional vectors with components f[i], x[i], and R is a vector valued function with components R[i]; t is time. Example: R[1] := proc (x::Vector) x[2] end proc; R[2] := proc (x::Vector) -x[1]*(1+x[3]^2) end proc; R[3] := proc (x::Vector) x[4] end proc; R[4] := proc (x::Vector) -x[3]*(1+x[1]^2) end proc; Now, the Liouville operator is defined as L := proc(F::algebraic,a::list(algebraic))