MaplePrimes Questions

Search Questions:

Latest Questions Latest Questions Feed

Dear all

I have a problem with a non linar equation systems. Basically it takes long time  to show me the results

The systems is the following,

R1 := -(1-y)*sqrt(1-x^2)-x*sqrt(1-y^2)+(1/4)*y*(x*sqrt(1-z^2)-z*sqrt(1-x^2))*J = 0;
R2 := -y*(sqrt(1-z^2)+sqrt(1-x^2))+(z+x)*sqrt(1-y^2)-(1/4)*sqrt(1-y^2)*(x*z+sqrt((1-x^2)*(1-z^2)))*J = 0;
R3 := -(1-y)*sqrt(1-z^2)-z*sqrt(1-y^2)-(1/4)*y*(x*sqrt(1-y^2)-y*sqrt(1-x^2))*J = 0;

solve({R1,R2,R3}, {x,y,z}) assuming J>0

Could one help me?

Thanks in advance


Hi all I'd like to have a for that runs for the pilot index inside a list of names, and that saves, for each value of the index a variable in an outer file. My problem is that I want the both the variable's name and the file's name to contain the name of the index, and I cannot obtain this behavior, as save asks for a name, not a command. My code would be something like A:=[a,b,c]; for i in A do cat(Mickey_,i):= something; #### that will correctly create Michey_a, Michey_b and Michey_c

Am I missing some justification for this last one?

> zip(`/`,Array([3]),Array([9]));
> zip(`/`,Array([3],datatype=integer[4]),Array([9]));
> zip(`/`,Array([3]),Array([9],datatype=integer[4]));
> zip(`/`,Array([3],datatype=integer[4]),Array([9],datatype=integer[4]));
Please help me Prims Code. Where am I wrong? Thanks. with(GraphTheory): G := Graph( { [{1, 2}, 3], [{1, 3}, 24], [{1, 4}, 35], [{1, 5}, 16], [{2, 3}, 5], [{2, 4}, 6], [{2, 5}, 17], [{3, 4}, 7], [{3, 5}, 38], [{4, 5}, 19] } ); DrawGraph(G); Prims := proc(G::Graph) local n, A, visited, i, j, k, min, a, b, T; k := 1; min := 999; T := Graph(0); A := WeightMatrix(G); n := NumberOfVertices(G); visited := { op( seq( 0, i = 1..n) ) }; visited[1] := 1; while k <>

Please help me DFS Code. Where am I wrong? Thank you.


Hello there Maple geniuses!

So I've been banging my head against these two problems for days and I was wondering if any of you had any idea how to proceed.

The first involves computing the limit of a series. The problem reads as follows:

"For large n, the sequence defined by

x1 = 2.30

xn = 9 * sqrt(xn-1+ 6)

approaches a limit. Find that limit correct to 15 significant figures, and then select the correct answer below."


I tried to do a Monte Carlo simulation with the Shuffle command from the Statistics package.

Unfortunately the distribution of the random sample differs significantly from the expected distribution even for large n.

Here is what I did:

Please help me BFS Code. Why am I wrong?

I tried the following:

Y9 := RandomVariable(LogNormal(a, b)):
assume(a::real, 0 < b):
c9:=solve({mu = Mean(Y9), sigma^2 = Variance(Y9)},{a,b}, UseAssumptions);


And received the following warning:

Warning, solve may not respect assumed property 'real' on 'a'.


How do I force Maple to account for property 'real' on 'a'?

Hi, Very new to Maple and am struggling with the basics, despite having read the manual(s). :-/ I want to enter the following expression in 2D Math: (a+b)*(b+c) and get back the following result from Maple: ab+b^2+ac+bc Instead, Maple gives me several different permutations of distributing a and b. I've tried all the "simplify" commands and none of them gives me the b^2. Ideas? Thanks in advance, n

I want to solve several systems of equations and force Maple to account for the assumptions which were made for the used parameters.

For example I tried the following:

Y1 := RandomVariable(Beta(nu, omega)):
assume(0 < nu, 0 < omega):
c1:=solve({mu = Mean(Y1), sigma^2 = Variance(Y1)},{nu,omega}, UseAssumptions);

Now the problem is, that UseAssumptions makes a distinction of cases, even if -like in this case- the results do not differ from each other.

How to find all Hamiltonian cycles of >G:=CartesianProduct(CycleGraph(k),PathGraph(n));? The command >IsHamiltonian(G);  finds only one such a cycle and this is enough in the most cases. There is a command HamiltonianCycles[G, All] in Mathematica 7 , but I don't find any single command to consruct the Cartesian product of graphs there ( k and n may be large numbers).

I want to ask it is possible to force Maple to show step by step solution but not use l'hopital's rule at all. Thanks


sorry for this question that it is surely for moron's level, but I am absolutely new to Maple, have read the manual, have checked internet and I cannot find a clear answer to the not-clear-to-me probably obvious.



I get

Hi, i must  write a programme but i have to prepare  this programme without sort and identify codes.the aim of this programme is to sort all the  entered irrational and rational number from the big to the little?

First 768 769 770 771 772 773 774 Last Page 770 of 1207