Hello! Why does Maple not compute the following residue? residue(((x^7+1)^4/x^30), x=0); Maybe the powers are too high? Are there any parameters I can set so that Maple produces a result? Thanks! Marco

How can I tell Maple to read all txt files in a specified folder ?
The names of each txt files are different ( I dont know the names )

Using maple help: wiht(plots): animate(plot, [Ax^2, x = -4 .. 4], A = -3 .. 3, trace = 5, frames = 50) the above command shows a plot with no animation... What's wrong?

*sigh* Mathematica,

 

how do I plot the bifurcation diagram with Maple of the function:

 

dx/dt = rx - sin(x) ?

My goal: given G(z,w), find the polynomial, P(n), in the partial derivatives of G(z,w) over the integer such that 

d^n z/ dw^n = P(n) / Gz^(2n-1)    where Gz= partial derivative of G with respect to z.

Step 1. Differentiate G(z(w),w) w.r.t w n times. Formulae are known for doing that (Mishkov, Tsoy-Wo Ma),

question1:

with(Optimization)

Minimize((1-b^2)/a+(1-c^2)/b+(1-a^2)/c, {a^2+b^2+c^2 = 1}, assume = nonnegative)

the result is strange:

[3.46410161513774462, [a = .577350269189626620, b = .577350269189626620, c = .577350269189626620]]

make the datatype not the float form in the results. 3.4641... to 2 sqrt(3)

question2:how to do this.I use sqrt(1-a^2-b^2) to substitute for c.

Minimize((1-b^2)/a+(1-a^2)/sqrt(1-a^2-b^2)+(a^2+b^2)/b, assume = nonnegative)

question3:

Hello, everyone! I would like to find a the unique, reduced grobner basis of a particular ideal. I know that gsolve in the old with(grobner) package would return this, but I can't decipher the documentation of the new with(Groebner) package to figure out how to do it.

If I have a list of polynomials and a given monomial order, I know that I can call:

with(Groebner);

my_gb := Basis(my_I, my_ord)

Hello!

I am solving numerically a non-linear Pde using the command  "pds:=pdsolve(....)"  and all are as they should be...[ pds := module ()...] but when i am trying to plot the outcome i receive: "Error, (in pdsolve/numeric/xprofile) unable to compute solution for t>.188000000000000000:Newton iteration is not converging "

Is there a way to overcome this problem (even if i must lose in accuracy..)???

Thanks!

 

My comp (AMD Athlon 64 Processor 3000+, 1.5 GB RAM) calculates the integral int(1/(x^4+3*x^2+1)^p,x=0..infinity) for p<=545 and the same comp with Maple 10 calculated this integral for p=3000. The answer is of the form k/n*Pi*sqrt(5), where k and m are natural numbers.

How to explain that?

Anyone know how to debug FOR loops in MAPLE? Thanks in advance.

Luciane.

Hi, guys, I want to compare the performance of procedures which are written by myself. But I have no idea how to get the runtime of a procedure. Thanks in advance.

Hello folks i was hoping for a spot of help.

I need to normalize three vectors. Each vector is 1 by 3 in size. Ive started by defining the vector then normalizing it by what i have defined it. The next stage is where im stuck, ive looked through various examples inclduing the one i this link: http://www.maplesoft.com/support/help/AddOns/view.aspx?path=LinearAlgebra%2fNormalize

Does anyone know where V:={1.55,1.56,1.53} comes from?

 I read to *.wav, copy them into two arrays with same size and I'm not able to write it anymore.

Anybody here who can help?

 

with(AudioTools);

with(ArrayTools);

readlib(FFT);

signalfile := cat("C:/Documents and Settings/848380/Desktop/", "klar.wav");

hfile := cat("C:/Documents and Settings/848380/Desktop/", "church.wav");

x := Read(signalfile);

y := Read(hfile);

Preview(x);

Preview(y);

Greetings

Good morning I'm looking for the best way to create an array with four index, let's call it V_{ijkm}, knowing that it is completely independent from the order of the index (eg V_{1234}= V_{2134}= V_{4213} =etc) and that I must use nested for cycles to initialize it, instead of a indexing function I can't guess how to insert the knowledge that the order of index in unimportant in the code Thank for any hints s.v.