Hello humble forum readers

I haven't used Maple in over 10 years and am therefor a bit rusty when it comes to runtime optimizations; on top of that, I'm not a mathematician, so bear with my limited knowledge in this field. A risk analysis problem of a rather complex system resulted in roughly following integral, which I seem to be unable to compute with Maple (Version 12, in case this matters):

binom[1]:=(a1+b1*exp(-(a1+b1)*t))^k[1];

binom[2]:=(a2+b2*exp(-(a2+b2)*t))^k[2];

The curve y= (224755712/(x^2+369664) is called a Witch of Agneesi.  You wish to place a rectangle between the Witch of Agneesi and the x-axis, and you want your rectangle centered on the y-axis.  Assign to area the maximum area of such a rectangle.  Use exact arithmetic (i.e. do not use evalf).  Can someone please tell me how you would go about solving a problem like this?  I have no idea!

Over on the usenet newsgroup comp.math.soft-sys.maple, someone asked about using Maple's overload facility to redefine the operators such as `*`, `+`, etc.

The difficulty for the submitter is that while overload (and option overload for procedures) can provide enhanced operators for new routines, it doesn't affect routines saved in the Maple Library which already have their bindings. Overloading does not subsequently change the bindings of the operators when used in (most all) Library routines.

One way to try and get around this is to actually redefine the global operators. And since overload is on topic, one can still use it in the replacements that one writes.

In order to redefine global operators one must first unprotect them. They are protected for a very good reason. If the replacements are not adequate then Maple can fail in a multitude of ways. It's a case of caveat emptor.

hello, now i confront a problem of a maple function---msolve.
I want to sovle the problem like this: i have a matrix with all entries only one or zero. and i have known the sum of unknows in each row and column. i want to get the entries in the matrix.
For example i have 3 by 3 matrix.
[x1 x2 x3
x4 x5 x6
x7 x8 x9]
i have known the sum of unknows in each row and column. for example,
x1+x2+x3=1; x4+x5+x6=1; x7+x8+x9=1; x1+x4+x7=1; x2+x5+x8=1; x3+x6+x9=1;
another constraint is x1 to x9 are only one or zero.

hello.

I have calculated an integral equation (general goursat problem) with an iteration method. I want to know how could I use MAPLE to derive a function for.

I found the first 4 iteration for function f.

the exact problem is U_xy=2.U.U_x .

U(x,y)=2x on y=x^2+x and U(x,y)=3x^2 on y=0.

I want to find the U function.

y=t^2+t

U₀=2t-3t^2+3x^2

U_n=U₀+int(2*U_n*(U_n)_x)

HI all,

I know that :

alias(delta=Dirac):

`δ*g` = int(delta(x)*g(t-x), x = 0 .. t) and int(delta(x)*g(t-x), x = 0 .. t) = g(t);

But look what happen.  Can someone justify this behavior

I really need to be able to continue this calculation past nmax=14 but maple just won't do it.
I'd like to take it as far as possible. Does anyone know why maple won't calculate past nmax=14 and
if it can be overcome? Is this too difficult to achieve? I'm completely lost. can anybody help?

>restart;with(plots);
> with(LinearAlgebra);
> nmax:=14:
> Order:=nmax+1:

Can anyone help with a purely Maple solution to this problem? (i.e. not having to download anything extra.)

Just for reference I'm woking on problem number 26 in "Schaum's Outline Series " for tensor Calculus.

It gives you a Schwarzchild metric and asks you to calculate the Einstein Tensor.  I'm using the example of doing this that's given in the "tensor" package help pages.  However I'm not getting quite the right answer.