Unanswered Questions

This page lists MaplePrimes questions that have not yet received an answer

I want to put the solution obtained from ShowSolution() command of Student[Calculus1] into my LaTeX file. How I can achieve that?

I succeeded in getting latex of ExpandSteps because it was a module, but ShowSolution() is not a module.

It's Alan's birthday and he's having a

party. Seven other people will attend.

Everyone will sit around the dining table.

The seating arrangement must meet the

following conditions:

* Amy and Alan sit together. Brad and

Beth sit together.

* Charles sits next to either Debbie or

Emily.

* Frances sits next to Debbie.

* Amy and Alan do not sit next to either

Brad or Beth.

* Brad does not sit next to Charles or

Frances.

* Debbie and Emily do not sit next to

each other.

* Alan does not sit next to either Debbie

or Emily.

* Amy does not sit next to Charles.

Who should sit where?

How can one use maple to linearized nonlinear ODE of this type Linearize.mw

with maple.

Best regards.

 

How can one deduce values of f(eta), diff(f(eta),eta) and diff(f(eta),eta$2) from values of f1,f2,f3,f4,.. in the results of the finite difference here Trial.mw . I need the outcome for f and its 1st and 2nd derivatives as listed above. Please help.

How do I compute the Lyapunov exponents for Lorenz system

Hello, my problem is that I've changed in tools maple default mode to "Maple input" from "2-d" I've aplied it globbaly and it doesnt'work. Still when type Enter it switch automatically to 2-d Math, and I have to change it by Ctrl-M to 1-d. Any ideas how to solve it? I want 2-d just to output.

Hi there,

I've got the following differential equation system:,

dU/dt = delta·dotD -lambda·U - kappa·U^2
dL/dt = (1-phi)·lambda·U + 1/4 ·kappa·U^2


being phi, delta, kappa, lambda, kappa some fixed parameters of the system, and where dotD (the derivative wrt time of a function D), which is defined a piecewise funtion:

dotD(t)=1/(3·T1)·DT for t in [0,T1]

dotD(t)=2/(3·(T2-T1-T))·DT for t in [T1+T,T2]

where T and DT are also known, and T1 approaches 0, and T2 approaches T1+T.

Setting the equation system in Maple and trying to solve it, gives a NULL result. However, trying to solve each piece separately seems to work fine.

Why is this?

 

Furthermore, taking limits for the [T1+T,T2] part (having solved each piece separately) yields an invalid limits point error. Ain't the possibility to take limits for both parameters at the same time?

Any ideas?

 

This is the Maple worksheet: MaplePrimes_LQ_model_solve.mw

Thank you.

jon

hi 

 

i solved my equation as follow , i want to know a compelet describtion that which method of pde/numeric methods is using .

 

thanks 


 

 

 

 

In Maple15, in spherical coordinates, what statements plot covariant vector [1,r^2*sin(theta),sin^2(theta)] and its contravariant equivalent [1,sin(theta),1/r^2] within their respective bases vectors. Assume r = 2, theta = pi/6 and phi = pi/4. I presume each plot will display the same space vector.

M := Matrix([[0,1,1,1,1],[1,0,1,1,1],[1,1,0,1,1],[1,1,1,0,1],[1,1,1,1,0]]);

how to multiply M[1] which is [0,1,1,1,1] with Matrix([[x0], [x1], [x2], [x3], [x4]])
to become [0,x1,x2,x3,x4]

may not use Matrix([[x0], [x1], [x2], [x3], [x4]])

just want to use first element as x0 when it is not 0

second element as x1, etc

Hello friends,


I try to write a loop in Maple.


The equation is f (x) = x + 3


x is a variable and should be from 50 to 70 with dx = 5 can be used in the function, so that f (x) is to be determined.

How can I write such a loop?

Hi

y''+(4/x)*y'-a*y^n=0

that a=constant

LM:=proc(n)
local L;
uses combinat;
L:=permute([1$(n*(n-1)/2), 0$(n*(n-1)/2)], n*(n-1)/2);
[seq(Matrix(n,{seq(seq((i+1,j)=L[k][(i-1)*i/2+j], j=1..i), i=1..n-1)}, shape=symmetric), k=1..nops(L))];
end proc:
M := LM(5);
N := nops(M);
append("E:\\mm.txt");
for i from 1 to N do
ExportMatrix( "E://mm.txt", M[i]);
od:

 

hope to export to a text file

and show

for example

matrix([[1,1,1],[1,1,0],[0,0,0]]);


matrix([[1,1,1],[1,1,0],[0,0,0]]);


matrix([[1,1,1],[1,1,0],[0,0,0]]);

...

etc

 

is it possible to generalize a function to a combinatorial level for approximate axioms

for example, first 100 or 1000 data points satisfy axioms

or 100% satisfy a axioms which means satisfy to infinity


because i find data always not exactly satisfy the axioms,
i guess it only satisfy to some limit, this may explain why data has decimal number

or conversely is it possible to generalize some axioms which approximate the original exact axioms
then data can exactly satisfy the approximate axioms

can generalize a nested forloop to achieve this goal?

how can it be done in algebra point of view?

 

For example:

x*y = for loop -> for loop -> i*j

it can change for loop expression into algebra

for i from 1 to 10 do
for j from 1 to 10 do
print i*j
od:
od:

Hi

 Mt := 1-(sum(4*l^2*exp(-beta[n]^2*tau)/(beta[n]^2*(l^2+beta[n]^2)), n = 1 .. infinity))

where the beta[n]s   are  roots of :

beta[n]*BesselJ(1, beta[n])-l*BesselJ(0, beta[n]) = 0

for  l=1,10,20,40,50,100

I want to plot Mt vs. tou for these l 's  in one diagram

 

First 244 245 246 247 248 249 250 Last Page 246 of 367