SHA-0.3.zip includes a Maple archive and help data base that implement the SHA algorithm (SHA-1, SHA-224, SHA-256, SHA-384, and SHA-512).  The implementation is interpreted Maple, so will be considerably slower than a compiled routine, but these should be fast enough for likely uses in Maple.  For example

CodeTools:-Usage(SHA("The quick brown fox jumps over the lazy dog", 512));
memory used=502.00KiB,...

Hello all,

 Is any anyone know how good is maple numeric stiff ode solver (stiff=true) ? What i mean is how many stiff ode's it can handle at a given time. I am having a hardtime solving a system of ode's (say 300 stiff ode's). Is there any other numeric stiff ode solver in maple that can handle large number of ode's?

I used islode advanced numeric solver for stiff ode's and it also has some limitations on the number of ode's and moreover it is slow.

I have been investigating Predator-Prey spatial models, e.g.

How to Plotting Matrix  8 × 8 matrix:

0, 0, 0, 0, 0, 0, 0, 0
0, 1, 1, 1, 1, 1, 1, 0
0, 1, 0, 0, 0, 0, 1, 0
0, 1, 0, 1, 1, 0, 1, 0
0, 1, 0, 0, 0, 0, 1, 0
0, 1, 0, 0, 0, 0, 1, 0
0, 1, 1, 1, 1, 1, 1, 0
0, 0, 0, 0, 0, 0, 0, 0

This matrix would correspond to the following image where 0=black and 1=white.

Gracias

How to output a list when writing a procedure

i want to get the list c in the procedure, but "return" c not work

z := [x1, x2, x3];
symMonomial(z)

symMonomial := proc(test)
with(combinat):
h := 0;
for i from 1 to nops(test) do
    h[i] := choose(z,i);
od;

c := 0;
for k from 1 to nops(test) do
    c[k] := 0;
    for i from 1 to nops(h[k]) do
        ki := 1;

I start with a question, but not an how-to question, because I am puzzled by why such a routine is missing.

Why does Maple not have  generalized Schur (real and complex) factorizations with reordering?  The nice solution of many dynamic equations requires this factorization because the lhs is singular. MatLab does have such a routine. At the moment, it seems, one has to have accessible and connect to MatLab or NAG or LAPACK for such routines.

Is this...

Using the following script with cmaple I got a plot with three legend elements. (see img link). 

How can I remove Curve 3 and Curve 5 entries?

with(plots):
plotsetup(gif,plotoutput=`test_maple.gif`,plotoptions=`color,noborder,portrait`):

l:=10^(-3);
Vel:=(y,t)->sum(n*y*t, n = 0 .. 10);

Vel1 := plot(...

I am trying to learn how to use Maple by working simple-minded projective geometry problems. I want to define a line in terms of two points, one of which is an intersection of two other lines. Must I define the intersection before using it as an argument, or is there a way to refer to the intersection without bothering to name it, as one might do in OOP by creating an anonymous object to use as an argument of the intersection procedure?

I want to show algebraically that the expected correlation is
decreasing in the tails of the distribution ie that the correlation coefficient
breaksdown when we have large moves. How can this be done?

Here is a standard example of how dcoeffs works:

> with(PDEtools);
> X := a*(diff(y(x), x, x))^2+b*(diff(y(x), x, x))+c*(diff(y(x), x));
                             2                     ...

for example:

i want to know how many numbers generated in this loops

[seq([seq(i, j = i .. 5)], i = 1 .. 5)]

[1, 1, 1, 1, 1], [2, 2, 2, 2], [3, 3, 3], [4, 4], [5];

as if there is no way that can make a "++" increment operator in maple 12

please give me advise how can i find some text fragment in Math 2D mode?

It may be of interest to this community that the original Maple Project at the University of Waterloo was awarded the ACM SIGSAM Richard Dimick Jenks Memorial Prize in June, at the joint ISSAC/SNC 2011 conference (overlap with FCRC 2011).

See here for the announcement.

I have a very simply equations 

eqs := {2.32 = a+b, pa = .4310344828*a, pb = .4310344828*b, pa+pb = 1}

pa is the persnet of a in the whole a+b

maple auto simplify pa = a / 2.32 to that.

I call the solve(eqs) and get the NULL return. that mean there is no solution for this eqs

but that's not true

even I do this

solve(eqs union {a=1})

it also return NULL

hi guys,

i need to solve s system pf three PDES numerically and ended up with "in pdsolve/numeric/process_PDEs) all dependent variables in PDE must have dependencies esplicitly delclared". Can anyone gives me a hint to fix it (worksheet is attached).

Thanks