Suppose that I am editing a plaintext file using vim. In my ~/.vimrc file I have a macro like this,

" run maple on current file
map ,mm :!maple -s -F %

Now, while editing file foo.mpl, I type (without first hitting the Esc key)

   ,mm

That starts a TTY maple session, reading in the contents of the current file/buffer. When I quit that maple session, I am back in vim.

With more effort and ingenuity, one could fashion a vim macro that could set libname and enable a savelib() call embedded in the plaintext. So a source file containing procedure or module definitions could be made to load into private .mla archives, all done from within the vim session.

acer

Suppose that I am editing a plaintext file using vim. In my ~/.vimrc file I have a macro like this,

" run maple on current file
map ,mm :!maple -s -F %

Now, while editing file foo.mpl, I type (without first hitting the Esc key)

   ,mm

That starts a TTY maple session, reading in the contents of the current file/buffer. When I quit that maple session, I am back in vim.

With more effort and ingenuity, one could fashion a vim macro that could set libname and enable a savelib() call embedded in the plaintext. So a source file containing procedure or module definitions could be made to load into private .mla archives, all done from within the vim session.

acer

> f:=x->ln(2-cos(x)+sqrt(3+cos(x)*(cos(x)-4))):
> r:=(n,p)->(1/Pi)*int((1-exp(-abs(n)*f(x))*cos(p*x))/sinh(f(x)),x=0..Pi):

> r(0,1);

                                      1/2
 
> r(1,1);

                                      2
                                     ----
                                      Pi
 
> r(1,3);

                                  46/3 - 4 Pi
                                  -----------
                                      Pi
 
> r(2,5);

                                  2236   97 Pi
                                - ---- + -----
                                   15      2
                                --------------
                                      Pi

> kernelopts(version);
             Maple 11.02, X86 64 LINUX, Nov 9 2007 Build ID 330022

acer

In general this is not a good way. It does nothing to run avoid choosing as pivots some entries whose values are expression that are actually equal to zero. Such as hidden zeros can then propagate in the denominators of a row reduced with that pivot. When the resubstitution is done, the results can then be expressions for which any evaluation will immediately result in "error, division by zero".

acer

In general this is not a good way. It does nothing to run avoid choosing as pivots some entries whose values are expression that are actually equal to zero. Such as hidden zeros can then propagate in the denominators of a row reduced with that pivot. When the resubstitution is done, the results can then be expressions for which any evaluation will immediately result in "error, division by zero".

acer

Not sure what more you might be after. Was wmsical an IBM RT running AIX 2.2, as seen here? And you gave a uucp bang path. So your mail came through utoronto? Full path was usually what, utai!watmath!wmsical or uunet!watmath!wmsical ?

acer

Does anyone else think that having package member routines get displayed as subscripted names in 2D Math output is unhelpful and misleading?

acer

It was an educated guess, to choose that assumption. It looked a little like a distribution function, or something similar for which it might be plausible, and I suspected that Maple's int() might have trouble (due to branch issues) handling the 3/2-fractional power otherwise.

Note that `int` (as well as `simplify`) knows something about how to use assumptions. So you may also succeed in one step with,

int(expr,v=0..infinity) assuming m/(Pi*k*T)>0

acer

It was an educated guess, to choose that assumption. It looked a little like a distribution function, or something similar for which it might be plausible, and I suspected that Maple's int() might have trouble (due to branch issues) handling the 3/2-fractional power otherwise.

Note that `int` (as well as `simplify`) knows something about how to use assumptions. So you may also succeed in one step with,

int(expr,v=0..infinity) assuming m/(Pi*k*T)>0

acer

> p:=t^6+t^3+1:

> P:=subs(t=y^(1/3),p);
                                      2
                                P := y  + y + 1

And so on, taking all three cube roots of the two complex solutions of P=0.

acer

> p:=t^6+t^3+1:

> P:=subs(t=y^(1/3),p);
                                      2
                                P := y  + y + 1

And so on, taking all three cube roots of the two complex solutions of P=0.

acer

Surely by fprime the instructor meant the first derivative of f with respect to x. Ie, D(f0), which you assigned to f1. Sometimes the notation f' is used.

f0:=x->x/(sqrt(x^2 + cos(x-1))):
f1:=D(f0):

Joe's shown you an automated way to repeatedly call fsolve and avoid the roots previously found. It's easier than doing things like the following.

plot(f1,-8..8);
plot(f1,-6..-1);
fsolve('f1'(x),x=-6..-4);
fsolve('f1'(x),x=-2..0);
plot(f1,3..8);
fsolve('f1'(x),x=3..4);
fsolve('f1'(x),x=6..8);

acer

Surely by fprime the instructor meant the first derivative of f with respect to x. Ie, D(f0), which you assigned to f1. Sometimes the notation f' is used.

f0:=x->x/(sqrt(x^2 + cos(x-1))):
f1:=D(f0):

Joe's shown you an automated way to repeatedly call fsolve and avoid the roots previously found. It's easier than doing things like the following.

plot(f1,-8..8);
plot(f1,-6..-1);
fsolve('f1'(x),x=-6..-4);
fsolve('f1'(x),x=-2..0);
plot(f1,3..8);
fsolve('f1'(x),x=3..4);
fsolve('f1'(x),x=6..8);

acer

Robert asked not to solve this. Hopefully I edited out an indefinite solution quickly enough.

acer

Robert asked not to solve this. Hopefully I edited out an indefinite solution quickly enough.

acer