Don't you mean counterclockwise? In the example that you gave, the points (0,1), (-1,0), (0,-1) are arranged counterclockwise.

@k20057 5 

I see what you mean. I wonder if what we need is to sample without replacement? I can't work on it for a few hours yet.

Do you have any guess for x, y, z? Can you restrict any of them to a range? Are they real?

@Kitonum 

Yes, I agree your code is better. Vote up. I am relying on the fact that binomial(n,k) = 0 for k a negative integer. That's more expensive than explicitly including the zeros. Also, my code has the procedure-call overhead for (m+1)^2 procedure calls.

@acer I think that you'll find some understanding if you look at the brief procedure `eval/laplace`, especially this

6   oper := eval(op(0,e),eqs);
   7   if oper <> op(0,e) then
   8     return eval(oper(op(e)),eqs)
       end if;

What about the procedure I wrote, RandomPartitions? I do not understand why that is not what you want.

@Markiyan Hirnyk 

I am using Maple 16 right now. Doing so, I get no tilde, but only when restart is in its own execution group. I will try again in Maple 18 (on a different computer) and report back (in several hours).

@nm 

I did not forget a line of code. I provided only the new line of code, which I intended for you to execute after the code that you had already posted.

@nm

I meant to execute the eval command after  the laplace expression returns unevaluated as per your originally posted code! Of course it makes no sense to substitute laplace= inttrans[laplace] in an expression that does not contain laplace.

f:= t-> piecewise(t<0,0,t>=0 and t<z,t,t>z,z):
r:= convert(f(t),Heaviside);
r:= inttrans[laplace](r,t,s);
eval(subs(z= 0.5, laplace= inttrans[laplace], r));

Also note that your piecewise can be simplified. It is not necessary to use compound Boolean conditions (i.e., with and) to exclude the conditions that have already been passed over on the left. So, your piecewise can be

f:= t-> piecewise(t < 0, 0, t < z, t, z);

@Markiyan Hirnyk 

You're right that it doesn't exactly say "its own execution group"; it says "its own prompt (or line)". Specifically,

It must be executed in a separate prompt (or line) from all other commands, since all commands in a prompt are passed to the kernel at once; entering other commands in the prompt could cause unexpected results.

However, I have found several examples where being on its own line is not good enough. These examples caused me to incorrectly recall the above proviso. I believe that all commands in the execution group are passed to the kernel at once, not just all commands on a line.

@nm Why do you say "Ok. Will live with this." after I had already given an Answer that lets you totally avoid loading a package and let's you work with the unevaluated expression??

@Markiyan Hirnyk 

You forgot the line

r:= inttrans[laplace](r, t, s);

which does appear in the OP.

@k20057 5 I don't know why that happens. That's weird. But, anyway, the list T can be sorted into proper order like this:

T:= [{T[]}[]];

@nm 

I didn't read any of the DynamicSystems documentation. I really don't even know what a "dynamic system" or a "transfer function" is. I just know that all modern Maple objects are implemented as modules, and the exports command and :- operator are used to look inside modules. Maple is consistent like that across various packages.

@JohnT 

It is preferred on this forum that you post plain text rather than images.

So, you want the values of q for t from 2 to 150?

q:= t-> (.807*(275000000*t^2/(.572*.3)))*(t^2/((1-.33^2)^3*.3^2))^(1/4):
seq(q(t), t= 2..150);