Math Forum / Math Software / Maple / June 2007

How to map two sequences to a function?
I've tried this, but don't work.
map(proc(x,y) x+y end proc,[1,2,3],[4,5,6]);
Thanks

Recently I was puzzled a lot by the numerical integrals.
1. When doing the inverse Laplace Transform via the Bromwich integral,
integrate( f(s)*exp(-s*x), s from c-i*inf to c+i*inf),
theoretically, c doesn't matter as long as c is on the right side of all the

I found an interesting sequence with recurrence relation
                       3
                    4 b  + 2 b - a
               c = -----------------               (1)

How to do rref(m) mod 2 with zero-one matrix?
(that is "rref" in mod 2 field) (not whole matrix mod 2)
thanks.

1)
One way I have found to convert
Mathematica expressions to equivalent
Maple expressions

Hi folks. I am plotting a 3d vector field with solution curves, and a
surface and displaying them simultaneously. Depending on the initial
conditions in the vector field plot, the orientation will change so that
when the plots are displayed simultaneously, the flow of the vf does ...

If I have a multi-dimensional integral, i.e. an N-D numerical integral, and
the N is determined at run time. That's to say, before running the program,
I don't know what's the value of N.
How can this N-D numerical integral be handled? Can Monte Carlo handle it?

Suppose I have a a function f(t), and I only know its Fourier Transform F(w)
in closed form, i.e. I don't know f(t) itself.
Now I want to integrate f(t)*g(t) on [-inf, +inf], where g(t) is another
function.

This is a how do I simplification question.
I am reviewing Linear Algebra.
with(LinearAlgebra);
A:=<a[1],a[2],a[3]>: B:=<b[1],b[2],b[3]>:

The two experiments below show an inconsistent behavior of
Maple's display().  Is there a good explanation for this?
I have tried this in Maple 11.
# experiment 1:

Hello again from the VM machine...
N[Integrate[Sqrt[z^2 + 1] Sqrt[z + 2], {z, -1, 1}]]
NIntegrate[Sqrt[z^2 + 1] Sqrt[z + 2], {z, -1, 1}]
-1.63118 - 2.23817 I

Does anyone know of a fast and efficienct general algorithm that returns the
decimal expansion digits of a given number?
For example:
Input: x=2.147382635142

Is there a function like factorset in "numtheory" for polynomial?

Dear Mr Bondarenko,
Could you write only ONCE a week a digest of Maple bugs?

This question came up previously; but I am curious if there is a
different solution.
Consider the following:
roll := rand(1..6);