Question 1

a := miu1 = Diff(lambda1(t),t) + lambda3(t);

b := miu2 = Diff(lambda2(t),t) + lambda1(t) - 4*lambda3(t);

c := miu3 = Diff(lambda3(t),t) + lambda2(t) - 3*lambda3(t);

d := miu = 2*Diff(lambda3(t),t$2) - 5*Diff(lambda3(t),t) + 7*lambda3(t);

 

how to eliminate all derivatives of lambda in miu

 

result in

miu - 2*Diff(miu3,t) - miu3 + 2*miu2 = 2*lambda1 - lambda2 + 2*lambda3;

 

I have now been stck in a few days on a task that should be done in maple. I'm pretty new to maple so hope some of you could help me a bit. The task is to create a table of a ball that is thrown, when the starting speed should be from 0.2 to 4, and each step should be at 0.2. Afther that the table need to be plotted. I have used euler method to sett the functions up and the functions is a vector. Any one know what comands i should be using?

I have here Maple proc, but it doesn't work. I am try to solve this equation 
pde := diff(u(t, x), t, t)-(diff(u(t, x), x, x))+x^2*u(t, x);

with 3 piont known , we have 
stencil:=u(i,j)=-u(i-1,j-1)+(1-h^2/8*v(h/2*(j-i-1))^2)*u(i,j-1)+(1-h^2/8*v(h/2*(j-i+1))^2)*u(i-1,j);

please see the file I attached here

Thank you

wave_proc.mw

I am try to program a proc that will plot the kinematic equations.

kinematics := proc(a::procedure, t::name, s0::numeric, v0::numeric, t0::numeric, t1:: numeric)

local v:=t->v0+int(a(t),t);

local s:=t->s0+int(v(t),t);

plot([a(t),v(t),s(t)], t=t0..t1);

end proc;

the above is my code, which works ok. 

Note: a is acceleration function, v is velocity function, s is position function, t is independent variable,...

(i)develop an algorithm for computing f¡ÊF[x,y],F a field,where the degree of f in y is less than n and and f(x,ui)=vi; for i=0,1......,n-1, for distinct ui∈F,and arbitrary Vi∈F[x].showthat f is unique.

(ii) assuming that the degree of each Vi is less than m, what is the computing time of your algorithm (in term of m and n)?

(iii) computer f∈ F[11][x,y]such thatf(x,0)=x^2+7,f(x,1)=x^3+2*x+3,f(x,2)=x^3+5.

sys := [1.8*a+.4000000000*b+103.9*c-.5000000000*e-102.6*g = 0, .5000000000*b+102.6*c+.3*d+.3500000000*e-102.1*g = 0, -3.3*a-1.050000000*b+102.4*c+.7*d+.2500000000*e-105.1*g = 0, -2.5*a+1.450000000*b+102.6*c+3.3*d+1.050000000*e-102.4*g = 0, -1.6*a+1.100000000*b+105.8*c+.3*d+1.750000000*e-105.5*g = 0, -.7*a-.2500000000*b+105.1*c-.2*d+.2000000000*e-105.7*g = 0, -.3*a-.3500000000*b+102.1*c+2.5*d-1.450000000*e-102.6*g = 0, .2*a-.2000000000*b+105.7*c+1.6*d-1.100000000*e-105.8*g = 0...

hello. how can I translate a graph in the x axis 3 times and then again in the y axis 2 times?

Find a(n)of sequence1,8,1,4,7,0,7,0,....   (n=1,2,3,4,...) ,

'1.8*a+.4000000000*b+103.9*c-.5000000000*e-102.6*g = 0', '.5000000000*b+102.6*c+.3*d+.3500000000*e-102.1*g = 0', '-.3*a-.3500000000*b+102.1*c+2.5*d-1.450000000*e-102.6*g = 0', '-2.5*a+1.450000000*b+102.6*c+3.3*d+1.050000000*e-102.4*g = 0', '-3.3*a-1.050000000*b+102.4*c+.7*d+.2500000000*e-105.1*g = 0', '-.7*a-.2500000000*b+105.1*c-.2*d+.2000000000*e-105.7*g = 0'

i use solve, it return a = a 

> 1) letJ subset F[7][x] be the set of all polynomials h in F[7][x] sloving the interpolation problem h(0);
=1,h(1)=5,h(6)=2. computer the unique polynomial f∈J of least degree.

2) find a surjective ring homomorphism ×:F[7][x]->F[7]^(3) such that Ker×=={rm:r∈F[7][x]};and computer ×(f)and×(x^2+3*x+2).

3) show thatJ=f+Ker×={f+rm:r∈ F[7][x]}.

> find*a*polynomial*f;

 in F[7][x] ofdegree less than 4 solving the congruence(x^(2)-1)∗f≡x^(3)+2*x+5 mod x^(4)+2*x+1 inF[7][x] .;

show that the residue class ring F[343]=F[7][x]/is a field,and computer the inverse of x^(2) mod x^(3)+x+1in F[343].

Hello everyone,

I saw a question on a different forum related to the stability of the numerical solution of a coupled ode system. The original question was about the convergence of the far field condition (infinity) for some specific values of the different parameters involved.  For the details please see the link below

http://mathematica...

How to calculate the integral of 1/sqrt(4*z^2+4z+3) over the unit circle counterclockwise for each branch of the integrand? Of course, with Maple.

Hi,I want to compute some expressions as binomial(d-2,r)*binomial(v-d-1,r-1) and something like that. In the process, there are many such expressions but with differernt parameters. Some of them can pass successfully, but some of them will generate a mistake. That is: Error, (in gcd/LinZip) variable in input expression must be in either the evaluate or retained variables.Could you please what happened to it? Thanks.