I want to creat a Matrix A with every emement in A Digits:=20,How can I do?A:=Matrix(n,n,?) waiting for your help!

Hello, I have a simple problem of the type; x = L(x)*x Where x is a column vector (2) and L(x) is a 2 by 2 matrix (function of x). I want maple to solve this equation for x. I just don't know what is the function to do this ("solve" doesn't work).

how can i import data from an excel spreadsheet into maple10? (please don't tell me i can only to it with maple11). cheers, jake

Hi, I am using the networks package to try to find out the total number of paths between two vertices of a graph. The graph I am interested in is basically a square grid with a diagonal from the lower left to the upper right. I want to find the total number of paths from the lower left vertex to the upper right vertex according to the following rules. 1. Can only move right 2. Can only move up 3. Can only move up the diagonal. So I wrote a procedure that would produce such a directed graph for any n. For any n the graph has n^2 vertices but only edges that meet the criterion given above.

I have a sheet in Maple 10 which I want to re-run in Maple 11. It contains a very lengthy (piecewise defined) function f(m) to be integrated over the Reals (numerical) and dito for exp(m)*f(m). The results are certainly ~ 1. In M10 this caused problems which can be overcome using method= _NCRule (I got the advice here ...) in both the cases, the result came up fast. In M11 I killed the execution, it needs to long. While integrating f(m) can be done by the NAG routines, that does not work for exp(m)*f(m). Certainly I could split up at the breaks for piecewise - but can somebody explain *why* it 'fails' now? And: no, I do not want to split up manually.

Set up a double loop in maple with the parameter "a" runing from 0 to 2 in steps of 0.02 and b running from -1 to 1 in steps of 0.02. Within de double loop set, set X0=a+b*I and compute 10 Newtons iterates. If X10 is close to 0, say absolute value of X10<0.1 then the iterates converge to 0. Color the pixel at (a,b) black if the iterates converge to 0 and white if not.
"Note": The equation to be set is X^3-3*X^2+2*X
Please help me in here, is due to tomorrow, and I've been trying all this week but I don't have any clue.
Best Regards,
Franklin...

I am using Maple to solve some inequalities where the solution I get is a RealRange or a real constant. And I want to get an union of these values. I wrote a short procedure which does the work. But is there a better way to do this (there must be :-) )? > RealRangeUnion:=proc(L::list) local L2, rel, rel2, eq, sol, x; > assume(x, real); > L2:=map(a->`if`(a::realcons, x = a, x in a), L); > rel:=convert(L2, relation); > rel2:=convert(Or(op(rel)), relation); > eq:=piecewise(rel2,1,0); > sol:=solve(1=eq,x); > RETURN(sol); > end proc: > > L:=[RealRange(Open(-2),-1), RealRange(Open(0),1), RealRange(1/2,2), -3, -2];

Hello, I am new to Maple (I am used to Mathematica 5.2). I have a differential equation which can be solved numerically (evolution of the scale factor of the Universe containing matter, radiation and dark energy). I've figured out how to use the interactive dsolve() to produce two dimesional plots of R vs. t, yet I'd like to make a nice 3D plot (in cylindrical coordinates) with [R ,R ,t] axes. Having a symbolic solution I would use Mathematica with something like: ParametricPlot3D[{R[t] Cos[x], R[t] Sin[x], t}, {t, -1, 3}, {x, 0, 2Pi}]; In the interactive dsolve() mode Maple offers 3-D plot but it is not what I want...

In several comments on a post about a surprising failure of an attempted Maple calculation, subscripted names and indexed names are discussed as if somehow are naturally meant to go together. But the only reason that they are associated in Maple's Standard GUI's 2dmath is because Maplesoft chose to implement it this way. My own feeling is that subscripted names and indexed names should certainly not...

Could someone help me please to incorporate the command for unique common solutions into a programme. I have a list of values a and b where x ==a(mod e) x==b(mod d) I have the following list of [a,b] pairs: [[0, 0], [1, 1], [0, 2], [1, 3], [0, 4], [1, 5], [0, 6], [1, 0], [0, 1], [1, 2], [0, 3], [1, 4], [0, 5], [1, 6], [0, 0]] I now need to write a procedure where I apply the following command: chrem([a,b],[e,d]) to find the unique common solutions for the listed pairs of a and b. for example chrem([1, 4], [2, 11]) = 15, where e (e=2) and d (d=11) are coprimes. Any hints on how I use each pair of a and b from the above list to generate a list for unique solutions using the chrem command would be most welcome.

Hello everybody, In the following code I wish to print a 6*N table. When I let the array run from 1..5 everything works fine. However I wish to run it from 0..5 as shown below. Once I do so the output looks completely messed up. Whats the matter with starting the array from 0? > mu := 'mu': > mu := array(0 .. 5, 1 .. N): > for n to N do > for S from 0 to 5 do > mu[S, n] := lambda[n]*baseleadtime[S] > end do; > end do; > print(mu); THX in advance.. Fred

It would be great if someone could give me a lead on this: I have 3 sets: A={1,3,4,8}, B={5,6,9}, C={2,0,7}. Is there a command in Maple that can produce all possible combinations of all numbers involved in 3 sets so that I could get the following result: [A1,B1,C1], [A2,B1,C1], [A3,B1,C1], [A4,B1,C1], [A1,B2,C1] etc I have tried the following but the result is: > comb(({1, 3, 4, 8}, {5, 6, 9}, {0, 2, 7}), 3); print(comb({1, 3, 4, 8}, {5, 6, 9}, {0, 2, 7}, 3)); comb({1, 3, 4, 8}, {5, 6, 9}, {0, 2, 7}, 3) thanks...

Hello I am trying to plot the same function over several different values for comparison. My problem is that whenever a plot is drawn, the axis is rescaled to fit the contents, for example in the following code > restart; > ReZ:=sin(omega); ReZ := sin(omega) > ImZ:=cos(omega); ImZ := cos(omega) > plot([ReZ,ImZ,omega=0..0.5]); > plot([ReZ,ImZ,omega=0..1]); The axis values differ, but the plots look exactly the same, which makes it very hard to compare them. I haven't been able to find a way to define the axis ranges i need so any suggestions would be appreciated

Hello everbody,

I will try to explain the problem from my previous blog in more detail:

The Problem I posted is part of an inventory optimization problem. There are n bases(warhouses) for which I wish to determine the stock level in such a way, that I meet a so called target fill rate. The fill rate is the percentage of demands that can be met at the time they are placed. The formula for the fill rate for base n given an Inventory Level S is the following:

tfrbase[n,S] := sum(basepipe[n]^j*evalf(exp(-basepipe[n]))/factorial(j), j = 0 .. S)

The variable basepipe[n] indicates the stock in the pipeline which consists of the average annual demand times the average lead time.

is there a reason this doesn't solve? (1/m)(int(b*t*(t[o]-t), t = 0 .. T)) it just spits out (int(b*t*(t[o]-t), t = 0 .. T))/m which isn't helpful...