I am interested in the behaviour of a system of equations close to the origin- these equations are quite long, and there are a lot of them so i would like to have commands that i can use to assume products of variables are zero. 

here are the first two polynomials:

alpha*k[a1]*B[1]^2+(-alpha*k[a1]-alpha*k[a2])*B[2]*B[1]+2*alpha*k[a1]*B[1]*B[11]+alpha*k[a1]*B[12]*B[1]+2*alpha*k[a1]*B[1]*B[211]+alpha*k[a1]*B[221]*B[1]+2*alpha*k[a1]*B[1]*B[2211]+(-alpha*R[b]*k[a1]-k[d1])*B[1]+2*B[11]*k[d1]+B[12]*k[d2]+k[d1]*B[211]+k[d2]*B[221]

(-alpha*k[a1]-alpha*k[a2])*B[2]*B[1]+alpha*k[a2]*B[2]^2+2*alpha*k[a2]*B[2]*B[22]+alpha*B[2]*B[12]*k[a2]+alpha*k[a2]*B[2]*B[211]+2*alpha*k[a2]*B[2]*B[221]+2*alpha*k[a2]*B[2]*B[2211]+(-alpha*R[b]*k[a2]-k[d2])*B[2]+B[12]*k[d1]+2*B[22]*k[d2]+k[d1]*B[211]+k[d2]*B[221]

the varables are the terms with B and a subsript and everything else is a parameter.

My intuition was to use coeffs but I couldn't get anything helpful

You have three cakes, with diameters 15cm, 20cm and 25cm (same width). You want to share the cakes equally among your four customers. How do you do it?
What if you want the cakes sliced into the minimum total number of pieces?

The answer is to cut the cakes in half, but five pieces is the minimum.

What I want is a procedure for a more general case.

m cakes (different diameters) divided equally amongst n people. what is the minimum number of cuts or pieces to achieve this.

cuts.mw

I'm modeling the interaction between rotation and vibration in water molecule. I've come up with the solution functions, but I wanted to make some illustrative animations to fully understand what is going on. I made an animation (in the very end of the attached file) showing vibration of molecule and I want the trajectory of each (of two) particles to be traced after it, how could it be done? Also I want to have the movement of the angular momentum vector (vector with components [Jx=J*cos(varphi)*sin(theta), Jy=J*sin(varphi)*sin(theta), Jz=J*cos(theta)]) be animated simultaneously with the vibration of molecule (on the same plot). Is it hard to achieve?

File: ClassicalTrajectoriesH2X_morse.mw

Hello. I want to replicate the results of this table in Maple.

My "attempt" uses the inbuilt dictionary, but it will only find the words of length n, not the frequency of letters in each ....

word_length.mw

Let say I have an array

A := Array([[1], [2], [3]])
Normally if I would like to extend it I will write, eg:

Extend(A, [[4], [5]])

But because this is not 1D array Maple will rise an error. Is there a way to go over this limitation?

hi

in attached file below not answer found for dsolve?

please help me

thanks..

dsove.mw

Download dsove.mw

so I'm trying this:

restart;

sigma := 0.143e-18;

l_0 := 1.87;

l0 := 1.87;

roll := rand(0 .. 25.0);

f_gauss := proc (x) options operator, arrow; exp(-(1/2)*x^2/`σ_x`^2)/sqrt(2*Pi*`σ_x`^2) end proc;

f_norm := proc (dx) options operator, arrow; int(f_gauss(x), x = -(1/2)*dx .. (1/2)*dx) end proc;

sol_gauss := proc (mix) options operator, arrow; evalf(eval(-ln((int(f_gauss(x)*exp(-2*sigma*N2O*sqrt((1/4)*l_0^2-x^2)), x = -(1/2)*dx .. (1/2)*dx))/f_norm(dx))/(sigma*N2O), [N2O = 0.25e20*mix/100])) end proc;

for ii to 10 do

a := roll();

eval(sol_gauss(a), [dx = l_0, `σ_x` = l0])

end do

Already searched and browsed multiple different threads and still cannot find a solution.

Apologizing the noob nature of this question.

In this code below, Why is the factor command not working?

Download factor_polynomial_2_multivariable.mwfactor_polynomial_2_multivariable.mw

hi...how i can pdsolve this equation numerically or analyticlly?

this equation is time-fractional  equation with generalized Cattaneo model

where

 is the fractional derivative operator considered in the
Caputo sense.

FRACTION.mw

Download FRACTION.mw

Dear Pros, I'm a biginer so I have a question about my program.

I have a lot of arrays which are result from 2 while loop. Now, I want creat a matrix from them but i can't. So, could you help me to do it.

For detail: 

V[1]:=[ 1 2 3]

V[2]:=[2 3 4]

V[3]:=[3 4 5]

V[4]:=[2 6 7]

V[5]:=[7 8 9]

...

V[n]

with type of V[i] is a array.

I searched and found a solution by manual to create a matrix as follow:

V_matrix:=<V[1],V[2],V[3]>

but in this case i can't but manual with n=100

please help me to have a Matrix.

Thank a lots.

Hi everybody, 

Could somebody just explain me why commands L[1..5] and L[3..6] below do not seem to return "the same type of thing" ?

Thank you for your attention

Download array.mw

how to specify color at the turning point of mountain shape in dualaxisplot

woud like to specify a point with another color at the top of peak shape line diagram

After using the Groebner and PolynomialIdeals packages, Maple goes into a long calculation when I make an entry of the form

name:=polynomial expression. This can take 10's of minutes for an expression of two lines. The only solution I have found is to save the sheet and restart it and enter the line name:= etc. before loading Groebner and PolynomialIdeals. This is most inconvenient. Is there a better workaround?