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...

I hope someone can help me. I am using Maple 10 to make a model of some of my research on fruitfly dorsal-ventral formation. I am far from a math and maple expert, so i hope someone in here can help me. I have plottet my data with pointplot3d and need a function i can fit to to my data. Have tried with one time-frame at a time, using fit[leastsquares], but don't get a good result. Have a lot of "noise" on my measurements, that probably wont give a good result, I therefore need a full 3d fit. The data seen from (y,z)-axis is increasing "shark-fin" pattern: .............................................xxxxxxxxx

I hope someone can help me. I am using Maple 10 to make a model of some of my research on fruitfly dorsal-ventral formation. I am far from a math and maple expert, so i hope someone in here can help me. I have plottet my data with pointplot3d and need a function i can fit to to my data. Have tried with one time-frame at a time, using fit[leastsquares], but don't get a good result. Have a lot of "noise" on my measurements, that probably wont give a good result, I therefore need a full 3d fit. The data seen from (y,z)-axis is increasing "shark-fin" pattern: ....................................xxxxxxxxx

Hello everybody, I want to determine the value for the variable S in 2 cases in the following function so that tfr=.85 is reached for both cases. First I tried to do this by solving the equation setting it equal to .85 which unfortunately did not work and then I tried to increase S successively until the minimum .85 would be reached. However, non of my attempts worked out as you can see below. I would be more than grateful if you could help me to solve this problem. Target Fill Rate for all Bases >tfr := 0.85 Average Base Pipeline for Minimum Lead Time >basepipemin[1] := 0.2; basepipemin[2] := 1.8;

here the second Approach, which did not fit on the other blog anymore:

for n to 2 do
for S to 10 while tfrbase <= tfr do
tfrbase := sum(basepipemin[n]^j*evalf(exp(-basepipemin[n]))/factorial(j), j = 0 .. S)
od od;

thx for every help...

Hello everybody,

I want to determine the value for the variable S in 2 cases in the following function so that tfr=.85 is reached for both cases. First I tried to do this by solving the equation setting it equal to .85 which unfortunately did not work and then I tried to increase S successively until the minimum .85 would be reached. However, non of my attempts worked out as you can see below. I would be more than grateful if you could help me to solve this problem.

<code>

Target Fill Rate for all Bases

>tfr := 0.85

Average Base Pipeline for Minimum Lead Time

>basepipemin[1] := 0.2; basepipemin[2] := 1.8;

hi all, i have an equation like this: a = Lambda[d]/(Lambda[d] + Lambda[in]); P(0, 0) = 1/(k + (Lambda[in] / Mu[in]) * (k - 1) + (Lambda[in] / Mu[m]) * (k - 1) + a* ((1 - a^(n - k)) / (1 - a)) + (Lambda[in] / Mu[in])* a * ((1 - a^(n - k)) / (1 - a)) + (Lambda[in] / Mu[M]) * a * (( 1 - a^(n - k)) / (1 - a)) + (Lambda[d] / Mu[D]) * a^(n - k)) Availability (A) = P(0,0)*(k + (a * (1-a^(n-k)))) i want to find the optimal Lambda[in] which max the A.. is there any non-numeric solution way and plot A-Lambda[in] graph?

I have benn assigned to do this: Set up a Double Loop in Maple with the parameter "A" running from 0 to 2 in steps of 0.02 and "B" running from -1 to 1 in steps of 0.02. Within the double loop, set Xo=A+BI and compute 10 Newton's Method Iterates. Now I don't have a clue how to solve it but I have been trying, It seems to me that I always head to a dead end solution.... By recommendation I have done this but I get stuck; I don't know how to do the double loop from this domains. I'm gonna write it down or if you want you can see it with the link below. > restart

Since I like working with wood - I just couldn't resist . . . a Maple Coffee Table

Hi everyone, I'm a newbie at Maple and am building a model for the transmission and reflection of EM waves in layered media. I'm trying to separate something like: R[s] = (-I*sin(q[m]*l/Z[m])*Z[1]*Z[t]-cos(q[m]*l)*Z[1]+cos(q[m]*l)*Z[t]+I*Z[m]*sin(q[m]*l))/(I*sin(q[m]*l/Z[m])*Z[1]*Z[t]+cos(q[m]*l)*Z[1]+cos(q[m]*l)*Z[t]+I*Z[m]*sin(q[m]*l)) into complex and real parts. Re and Im don't seem to work. In fact if I take an equation like: f:= cos(x) + 2*sin(4*x) and run Re or Im on it, it doesn't seem to work. Any assistance would be much appreciated! Thanks,