For some reason machine thinks that I am trying to add a matrix to an equal sign.

Is it italic when copied and pasted?  Is it bold when copied from maple 8?  I just ahve not been able to work it out.

The only way that I can think of doing it is by multiplying by a tetrad.  Even then it does not work well see my worksheet:  The Dirac Equation in Robertson-Walker spacetime.

Factorise

into your Maple worksheet and copy and paste the Maple output into the answer box below.

I have a recursive function that spits out recursive formulates "evaluated inertly" so bascially it produces a formula simply like a symbolic formula(doesn't reduce the addition of values though).

What I would like is to color code each recursive step

e.g.,

F := proc(n)
    local i,k:
    if n <= 0 then return 1; end if:
    F(n-2) %+ F(n-1):
end proc:

F(5);

value(F(5));
 

so I would like to cover each part of the recursion differently so it is easier to see, maybe even use the previous colors so one can visualize the nestings of the recursion. (e.g., F(n-2) takes the previous formals color and tweaks it towards the red and and F(n-1) takes the porevious formulas color and tweaks it towards green)
(this would then pass an RGB value that(default, say blue) to the functions above).

Any way to accomplish this?

Enter the value of cos^-1(0.62) to 15 significant figures in the box below.

by cos^-1(0.62) I mean arccos(0.62) or inverse of cos(0.62)

For the following system, the parameters D_1,D_2,D_3,D_4,D_5,D_6,S are all positive, How can I get all the  equilibrium  and their stability.

diff(x1,t)=fS;diff(x2,t)=fV;diff(x3,t)=fC;diff(x4,t)=fR;

fS := -D2*x1*x2-D1*x1-x1*x3+S; fV := D2*x1*x2-D4*x2+x1*x3; fC := -D6*x3*x4-D5*x3+x2; fR := D6*x3*x4-x4

I want to set up an RSS or IFTTT so that I get a notification on my phone whenever there's something new in the Active Conversations stack. My phone uses Google Android. I'd prefer to not need to rely on email/gmail for the notification; something more endogenous to Android would be preferable. I've never used RSS or IFTTT, so detailed instructions are preferable.

Hello everyone

First day using Maple and I've been given the following task: 

Design a function rangetolist(intrange) which expects an expression intrange of the type .., i.e., of the form m..n as its argument and converts it to the list
[m,m+1,...n] Also test what happens if m is larger than n. Hint: This readily works using seq.

I can't quite seem to get it working, online resources haven't been too helpful in resolving the issue unfortunately. 

Here is my attempt 

Hi , I have a system of equations and initial or boundary conditions. My.question how to solve these equations and their conditions together? And I can’t use dsolve because my result system doesn’t contain any derivative. In addition I couldn’t use fsolve because I don’t know how to collect the system and the conditions to solve together as a one system , and some examples contains equations morethan number of variables.... please can you advice me a solution 

thanks 

Why won't simplify give the obvious result and Why does testeq give a Fail result in this case?

with(RealDomain);

assume(0<f,0<g);

simplify(f*sqrt(g/f));

testeq(f*sqrt(g/f)=sqrt(f)*sqrt(g))

Hi everyone,

I have 4 expression, each containing several parameters (3, I think).

I need to find the range of the values of the parameters for which one of the expressions is at least as great as any of the other expressions.

So the input of the program/function would be the expression and which one I want to be the (weakly) greatest, and the  output should be something like: [parameter a is a member of the set [0.1,0.5] and parameter b is a member of the set [1.2, 2.4] and parameters c is negative] (meaning if these are true, then the given exoression is the (weakly) greatest of all the given expressions.

Is there a way to do this in Maple?

(For the curious: I have a game-theoretic problem, where the payoff functions include several parameters. I am trying to find the best response functions to find the Nash.equilibria of the game for the different range of parameters)

Thank you in advance,

JTamas

I have a formula that essentially is a m-order sum over a totally ordered set(the integers).

sum_{n_1=1)^{n_0} ... m times ... sum_{n_m=1}^{n_{m-1}}

It may be a little confusing but essentially it is just summing over all monotonic lidyd of size m of [1..n_0]

e.g., if n_0 = 4 and m = 3 then

1 2 3

1 2 4

1 3 4

2 3 4

Does maple have a convient way to do this? Ideally some function like osum(..., i=1..n_0, m)

where i is a multi-index(just the ordered list here so I could access i[1] the smallest, value, i[2] is the next largest, etc).

How can i solve below equation?

diff(v,x,x)+diff(v,x)*cot(x)-v(cot²(x)+nu)=a²Q/D

that Q is function of x

Q=Q[x]

Download SC-plots.mw

I am having difficulty getting solutions to a pair of PDEs.  Would anyone like to cast an eye over the attached file, incase I am missing something.

Thanks

Melvin