how to calculate the shorting routing path in cayley graph?

i search that it is related with knuth bendix

hello everyone. I have an undergradute project i'm currently working on and I'm stuck where I have to use the Differential Transforms Method to solve a problem with boundary conditions at infinity

restart;

Digits := 5;

F[0] := 0; F[1] := 0; F[2] := (1/2)*A; T[0] := 1; T[1] := B; M := 2; S := 1;

for k from 0 to 10 do F[k+3] := (2*(sum((r+1)*F[r+1]*(k+1-r)*F[k+1-r], r = 0 .. k))-T[k]-3*(sum((k+1-r)*(k+2-r)*F[r]*F[k+2-r], r = 0 .. k))-M*(k+1)*F[k+1])*factorial(k)/factorial(k+3);

T[k+2] := (-3*(sum((k+1-r)*F[r]*T[k+1-r], r = 0 .. k))-S*T[k])*factorial(k)/factorial(k+2)

end do; f := 0; t := 0;

for k from 0 to 10 do

f := f+F[k]*x^k;

t := t+T[k]*x^k end do;

print(f);
print(t);

but the problem is that i cant seem to evaluate

or higer diagonal pade-approximant. any help will be greatly appreciated. thank you.

@Markiyan Hirnyk   I try not to use this package, as I think the results are not reliable enough. Here is the example, where instead of the three real roots it finds only one, despite the hint to look for the three roots:

restart;

DirectSearch:-SolveEquations(100^x=x^100, AllSolutions, solutions=3);

There are many other examples, particularly in discrete optimization in which it returns false results. Here is one example (well-known to you).

Hello, i am recently doing a lot of my (really simple) equation manipulations with Maple and would like to include an expectation operator E( ) in my symbolic equations. As maple threads E() as a function, differentiating is not very convenient, as i have to replace all D(E) ... manually. I tried defining some properties of E() via the define() function, but when trying to set the behavior of d E(f(x))/dx I am not sure how to use (diff()=result) in the define() function. Any help or ideas are greatly appreciated!

How can I solve this equation 18 *9^(x^2 + 2* x) + 768* 4^((x + 3)* (x - 1)) - 5 *6 ^((x + 1)^2)?

I tried

restart:

A:=18 *9^(x^2 + 2* x) + 768* 4^((x + 3)* (x - 1)) - 5 *6 ^((x + 1)^2);
solve(A=0);

I see that, the equation has three solutions: x = -2, x = -1 and x = 0. I check

f:=x->18 *9^(x^2 + 2* x) + 768* 4^((x + 3)* (x - 1)) - 5 *6 ^((x + 1)^2);

f(-2);

f(-1);

f(0);

Another question, Maple can not solve inequality 

18 *9^(x^2 + 2* x) + 768* 4^((x + 3)* (x - 1)) - 5 *6 ^((x + 1)^2) > = 0.

PS. We can easy to solve the above inequality with Mathematica

Reduce[18 9^(x^2 + 2 x ) + 768 4^((x + 3) (x - 1)) - 5 6 ^((x + 1)^2) >= 0 , x, Reals]

I got x <= -2 || x == -1 || x >= 0

Hi all,

Please help in writing finite difference algorithm for a nonlinear PDE using Maple.

for a[j], b[j] known at time n, I want to compute A[j]  for a[j] at time n+1 according to the equation below

EQs:=A[j]-theta*tau*(A[j-1]-2*A[j]+A[j+1])=a[j]+sqrt(a[j])*b[j]*h^2/tau+(1-theta)*tau*(a[j-1]-2*a[j]+a[j+1]) ;

Thanks in advance.

Dear I want to define a general operator D for Fractional derivative whose behave like this

(D^alpha)(t^beta) = GAMMA(1+beta)*t^(beta-alpha)/GAMMA(1+beta-alpha)

guys, i have this equation which a, n, c, phi[0] are parameters and r is variable. maple solved this equation with n=0,c=c,phi[0]=5/4-1/4 c but i obtained another solution for this equation : a = 1, c = 5, n = 1, phi[0] = 1 ( you can check). 

how can i get all solutions for a equation like this ?

Download eq000.mw

As I am beginner in maple, how to verify Bianchi Identities?

For Riemannian manifold,

1) R(X, Y)*Z+R(Y, Z)*X+R(Z, X)*Y = 0 

2) ((&nabla;)[X]R)(Y,Z)W+((&nabla;)[Y]R)(Z,X)W+((&nabla;)[Z]R)(X,Y)W=0

I am not getting how to define vector fields. From my previous question I understood defining vector fields particularly. From that post I tried to verify the proof, but I cant. Please tell me about how to define vector fields without taking examples.

Thank in advance.

Hi, does anyone know how to plot a Bode diagram (phase and amplitude plot)? I am not looking for preparation of data but rather for the technicality of producing a plot that looks like I want, given I have data in the right form (which in my case are three Vectors: frequency, amplitude and phase).

Below is a rough sketch of what I am looking for. Note that the amplitude is on a log scale. It would be acceptable having to take the log of the data "by hand" to allow both vertical scales to be linear (I'd just convert the amplitudes to dB). The important things are the common frequency scale (horizontal) and the separation of amplitude and phase. I know plots has  dualaxisplot, and I know I can use plots:-transform to move a curve around, but I want the two axes on the left side, below each other, rather on the left and right. I'd like the frequency scale in the middle between the two curves, although I could settle on that scale to be below both curves.

I had some look around the Maple applications but did not find anything looking like this.

Thanks,

Mac Dude

My code works in Maple (18.02), not Maple Player (2015.1). Much headache ensued.

I've isolated the problem in a toy form:

Defn := proc (scaleby)
whattype(scaleby);
end;

Explore(Defn(p), parameters = [p = [1, 10, 100]]);


In Maple will return "integer" for any value of p selected in the combobox.

In Maple Player returns "string" for any value of p selected in the combobox

Is there something I'm missing here? Is Maple Player not backwards compatible to versions of Maple prior to 2015?

My understanding is that Maple Code should export without headache to Maple Player. Is this a solid understanding?

Thanks for helping out a newbie!

My code works in Maple (18.02), not Maple Player (2015.1). Much headache ensued.

I've isolated the problem in a toy form:

Defn := proc (scaleby)
whattype(scaleby);
end;

Explore(Defn(p), parameters = [p = [1, 10, 100]]);


In Maple will return "integer" for any value of p selected in the combobox.

In Maple Player returns "string" for any value of p selected in the combobox

Is there something I'm missing here? Is Maple Player not backwards compatible to versions of Maple prior to 2015?

My understanding is that Maple Code should export without headache to Maple Player. Is this a solid understanding?

Thanks for helping out a newbie!

Is Maple 18 student version CUDA enabled? I am getting when I tried CUDA:-IsEnabled();

Error, `CUDA` does not evaluate to a module

thanks

I have an expression like this (from an earlier computation):

2*(sum(A*cos(omega*t)^2+cos(omega*t)*B*sin(omega*t)-cos(omega*t)*ymeas(t), t));

I want to distribute the sum over the terms in the expression, i.e.

sum(A*cos(omega*t)^2,t)+sum(cos(omega*t)*B*sin(omega*t,t)+sum(cos(omega*t)*ymeas(t), t)));

I suspect defining a rule and using applyrule should be the way to go, but for the heck of it I can't figure how to do it. The best I can manage is getting the Maple kernel hung with the following construct:

distSum:=sum(A::algebraic+B::algebraic+C::algebraic,D=algebraic)=sum(A,D)+sum(B,D)+sum(C,D);

applyrule(distSum,(5)); # (5) referrs to the expression on line 2 (and it is a proper label in my Maple wrkbook).

I have asked similar questions before and gotten answers; but I am not able to find what I need in MapePrimes (or my faorites, for that matter).

Thanks for any help,

Mac Dude

Hi everyone,

I would like to use structs

    struct sname {
        smem1;
        smem2;
    }

in my C code defined elsewhere. How do I get CodeGeneration to produce variable names like

    sname.smem1

?

The appoach to use the respective maple data type

  sname := Record('smem1', 'smem2'):
  CodeGeneration[C](sname);

results in

    Warning, procedure/module options ignored
    double smem1;
    double smem2;

and the appoach to define it as name

    CodeGeneration[C](`sname.smem1`);

results in

    Warning, the following variable name replacements were made: sname.smem1 -> cg0
    cg = cg0;

Your answer is appreciated

Fabian