how to use reduce command to get prime ideal?

i find PrimeDecomposition and PrimaryDecomposition in package with(polynomialideal):

is the primedecomposition for prime ideal?

any command same as http://www.singular.uni-kl.de/Manual/3-0-4/sing_244.htm

Can anyone explain why I get a different answer if I use int instead of Int in the following evaluation:

> evalf(subs(r = 1, Int(Int(Dirac(x1+x2-r)*q, x1 = 0 .. 1), x2 = 0 .. 1)));
                                 1.676209155

> evalf(subs(r = 1, int(int(Dirac(x1+x2-r)*q, x1 = 0 .. 1), x2 = 0 .. 1)));
                                     0.

Currently, the size of a table/matrix which can be exported to a spreadsheet is limited to 255 columns X 65535 rows. I believe this rule was implemented because of the maximum possible size of a spreadsheet(Am I right?) . This used to be the case in Excel 2003, but since Excel 2007, a spreasheet  can be : 1,048,576 rows by 16,384 columns.

Maybe it is time to update this rule?

Excel 2003 :http://office.microsoft.com/en-us/excel...

hi, i have a function in seri's with one unknown parameter and i want to solve it for this boundary condition : f(infinity)=1

I use pade approximation but in my case it doesnt work. i want to know is there exist other  method in maple for this problem. for example other rational function.

thx

for simple case 2*2,  A = matrix([[0,-1],[1,0]]);

using A, i understand f(x,y) = f(-y,x)

where do other case f(-x,-y) and f(y,-x) come from?

any command to list all cases with input a matrix A?

if A has more dimensions, what will the cases be ?

Hi , how do I get the binomial expansion of  1/sqrt(9+4*x^2) .  I am using expand(expression,binomial) . But Maple just

returns the expression.  Thanks .

how to x1, x2 ... with xi in procedure?

b := 1;

for i = 1 to 3 do

     b := b*1/(1-xi);

od;

but xi can not represent x1, x2, x3, which commands can present x1 x2 x3 ?

which package containing command to find prime ideal and quotient of ideal?

How to assign value to matrix in procedure?

with(ArrayTools):
kontraHom := proc(M, s)
dim := Size(M);
n := dim[1];
m := dim[2];
R := [][];
for i from 1 to m do
    for j from 1 to s do
        for k from 1 to n do
            R[(j-1)*n+k,(j-1)*m+i] = M[i,k];
        od;
    od;    
od;

I'm running simulations in which I produce many plots at once, the purpose being to compare differences as parameters are changed. I'd also like to use some of these plots for publication. I've had problems getting good-looking 3d plots. Here's a strange thing I noticed.

Export the graph by mouse-clicking, export to bitmap:

EDIT : IMAGE POSTED IN MY COMMENT BELOW

Export the garph by executing a plotsetup('bmp') command.

1. How many and which file format can be used to save a list of formulas?

2. how to append to above file?

i would like to let c# program to read the formula in the saved file

Hello,

I am going to solve 2D Laplace equation for function Φ(x,y) in a rectangule which has a*b dimension, yet its boundary condition, at least for me, is rather complex. Here it is:

d/dx(Φ)=0  at  x=0 , x=a

Φ=1  at  0<x<a/2 , y=0   

d/dy(Φ)=0  at a/2<x<a , y=0

what is the command to computing syzygy ideal in maple?

Hey,

I have a set of Matrices of the form [a,b,c,d], now I since the standard = doesnt work with matrices, but I have to instead use verify I wanted to ask how I write a function that returns true or false depending on whether a new matrix is already contained in the set. Or otherwise I want to filter the set so that I only have each matrix once.

Thanks!