MaplePrimes Questions

if there is a equation subs(...)

how to make a similar symbol like Diff(f(t),t) and diff(f(t),t) use for a new solver procedure use?

Hello Everyone;
I want to make this code complete in proc envirement (Proc command in maple). Kindly help me. Thanks in advance.

There are 10 questions. each question has one negetive point and three positive points. what is the number of students so that there will not be any repeatitive grades so all the students have distinct grades. Thanks in advance

Hello Everyone, 

I am new to Maple and I have designed an algorithm to compute multivariate differential dimension Grobner bases. Now I want to add this Maple as a package but I do not how to do that.

Can someone please help with this.

Thank you so much for your help.

My code can be found at


I am a newbie and therefore have a rather simple question for the community:

By reading in my measurement data (topographic data) I have generated column vectors:
for i from 1 to k do
    B[i] := Vector(A[1 .. k, i]);
end do:
where k is a predefined rank of the original square matrix. The arithmetic mean was then calculated for each individual column vector:
for i from 1 to k do
    Am[i] := add(B[i][n], n = 1 .. k)/k;
end do:

Now I try to create new column vectors by subtracting the corresponding mean value from each entry of the original vectors, something like that:
for i from 1 to k do

But I just can't get it right. Can anyone help me? Thanks in advance!



For example, the column dimension is 6 and I ran the following command,

A := Mod(2,Matrix(3,6,(i,j)->if i<2 and j < 3 then 1  elif i = 2 and j > 2 and j <5 then 1 else 0 end if),float[8])

the result is the following matrix with the last row containing all 0s. 

A := Matrix(3, 6, [[1., 1., 0., 0., 0., 0.], [0., 0., 1., 1., 0., 0.], [0., 0., 0., 0., 0., 0.]])
Actually, I want the last row containing all 1s but I do not know how.
Any help?


i want to write a expression without any quotes . for example in this case i want to wrate E*1    E*2 

I can remove this error.?

I if a run the CompleteSquare command 


CompleteSquare(x^2 + y^2 - 2*x - y - 2 = 10, x, y)

the output is (y - 1/2)^2 + (x - 1)^2 - 13/4 = 10

Why does it places the y's before the x's? 

How do I compute the gcd of polynomials with scalars e.g. how to compute gcd (x^9-a, bx^6-c )  as polynomials in x.   here I don't see how to specify the polynomials are in x.

Is the linux version of Maple architecture dependent? 

Hi everyone, I have a problem in the code solving coupled partial differential equations. I could not find out the solution. Please help me out with this. Find the code in the attachment.

I didn't understand what the page on implicit differentiation meant by 2nd derivatives are just like in using diff    Like this  implicitdiff(y^2 = x^3+a*x+b, y, x, [x$n]) ??  idk 

I have the following ODE which I would like to solve with Maple rather than solving by hand (having solved this type of equation by hand many times now):

diff(f(x,y,z),z$2) = A - B*e^(-A*z)

where A and B are constants and I have indicated the second derivative of a function of x,y and z with respect to z.  

Dear maple users,
I am solving an ode problem with an analytical solution.
programming running properly, but my plot not exact with the already existing article plot. 
how to get the exact plot.

Thanking you.


N := 3;





dsolve(diff(f(x), `$`(x, 3)));

f(x) = (1/2)*_C1*x^2+_C2*x+_C3


Rf := 2*(diff(f[m-1](x), x, x, x))-(2*mh*mh)*(diff(f[m-1](x), x))+sum(f[m-1-n](x)*(diff(f[n](x), x)), n = 0 .. m-1)-bet*(sum(sum(2*f[m-1-n](x)*(diff(f[n-t](x), x))*(diff(f[t](x), x, x))+f[m-1-n](x)*f[n-t](x)*(diff(f[t](x), x, x, x))+x*(diff(f[m-1-n](x), x))*(diff(f[n-t](x), x))*(diff(f[t](x), x, x)), t = 0 .. n), n = 0 .. m-1));

2*(diff(diff(diff(f[m-1](x), x), x), x))-2*(diff(f[m-1](x), x))+sum(f[m-1-n](x)*(diff(f[n](x), x)), n = 0 .. m-1)-.2*(sum(sum(2*f[m-1-n](x)*(diff(f[n-t](x), x))*(diff(diff(f[t](x), x), x))+f[m-1-n](x)*f[n-t](x)*(diff(diff(diff(f[t](x), x), x), x))+x*(diff(f[m-1-n](x), x))*(diff(f[n-t](x), x))*(diff(diff(f[t](x), x), x)), t = 0 .. n), n = 0 .. m-1))


dsolve(diff(f[m](x), x, x, x)-CHI[m]*(diff(f[m-1](x), x, x, x)) = h*H*Rf, f[m](x));

f[m](x) = Int(Int(Int(CHI[m]*(diff(diff(diff(f[m-1](x), x), x), x))+2*h*(diff(diff(diff(f[m-1](x), x), x), x))-2*h*(diff(f[m-1](x), x))+h*(sum(f[m-1-n](x)*(diff(f[n](x), x)), n = 0 .. m-1))-(1/5)*h*(sum(sum(2*f[m-1-n](x)*(diff(f[n-t](x), x))*(diff(diff(f[t](x), x), x))+f[m-1-n](x)*f[n-t](x)*(diff(diff(diff(f[t](x), x), x), x))+x*(diff(f[m-1-n](x), x))*(diff(f[n-t](x), x))*(diff(diff(f[t](x), x), x)), t = 0 .. n), n = 0 .. m-1)), x), x)+_C1*x, x)+_C2*x+_C3


f[0](x) := 1-exp(x);



for m to N do CHI[m] := `if`(m > 1, 1, 0); f[m](x) := int(int(int(2*CHI[m]*(diff(f[m-1](x), x, x, x))-(2*h*H*mh*mh)*(diff(f[m-1](x), x))+h*H*(sum(f[m-1-n](x)*(diff(f[n](x), x)), n = 0 .. m-1)), x)-h*H*(sum(sum(2*f[m-1-n](x)*(diff(f[n-t](x), x))*(diff(f[t](x), x, x))+f[m-1-n](x)*f[n-t](x)*(diff(f[t](x), x, x, x))+x*(diff(f[m-1-n](x), x))*(diff(f[n-t](x), x))*(diff(f[t](x), x, x)), t = 0 .. n), n = 0 .. m-1))*bet, x)+_C1*x, x)+_C2*x+_C3; s1 := evalf(subs(x = 0, f[m](x))) = 0; s2 := evalf(subs(x = 0, diff(f[m](x), x))) = 0; s3 := evalf(subs(x = 1, f[m](x))) = 0; s := {s1, s2, s3}; f[m](x) := simplify(subs(solve(s, {_C1, _C2, _C3}), f[m](x))) end do:

f(x) := sum(f[l](x), l = 0 .. N);








Analytical solution approach:





First 318 319 320 321 322 323 324 Last Page 320 of 2133