I uploaded to my file section a file called "Kill and Imprison Order""

Thanks to your help, this program works. I can specify an arbitrary order, such as [4,6,1,15] of players who kill or imprison other players. The program will then eliminate other players given player 4 gets to kill and imprison first, then player 6, and so on. However, I now need to test this in a for-loop over ALL permutations, or over a selected subset of the set of all permutations, of all the players.  Is that possible in Maple?

How do I delete files I have uploaded in my file section?

Does Maple have a command for return true or false when querying set membership of an element?

I have sets of random integers, Stuff[k], indexed by k, for example

Stuff[9]:={2,5,6}:

I need to be able to test if

7 is a member of Stuff[9]: // I should get false

5 is a member of Stuff[9]: // I should get true

There is no such set membership function listed in the Help menu.

I finally figured out a for loop for sequentially removing one set from another (set-theoretic subtraction).

I spent the last 2 hours searching in the Help commands for the command that returns the length or size of a given ordered array or list.

e.g. I have Thing:=[3,7,6,5]:

I want the function that returns the value 4 for the size of Thing.

I am really surprised that such an operation is so difficult and hard to compute that it is never in any of the Help menus.

I need the formal solution to the inverse of (d(m) = sum of c(k)/(k-m)! from k = m+1 to j  for all m from 0 through j-1). Egorychev's theory of turning summations into complex integrals seems to work only on his chosen examples, namely, where the summation index, k, is the lower variable in the binomial coefficient, not the upper variables as in my case k-choose-m, if one redefines c(k) as c(k)*k! and d(m) as d(m)*m!  Any ideas?  Thanks!