wrldwzrd89

Oct 8, 2008, 12:38 PM

... at least I think this is a math problem :p

Anyway, I have x numbers to put in 7 slots, where x is always odd, repetitions are allowed, not all of the available numbers need be used, the ordering of the numbers matters, and the numbers have to be put into the slots in such a way that the sum of all the slots is 0. For example:

1: 0 2: 1 3: 2 4: 0 5: 0 6: -2 7: -1This arrangement satisfies all the conditions (x in this case happens to be 5).

What I want to know is how many unique orderings are possible, given the value of x and the conditions above.

Anyway, I have x numbers to put in 7 slots, where x is always odd, repetitions are allowed, not all of the available numbers need be used, the ordering of the numbers matters, and the numbers have to be put into the slots in such a way that the sum of all the slots is 0. For example:

1: 0 2: 1 3: 2 4: 0 5: 0 6: -2 7: -1This arrangement satisfies all the conditions (x in this case happens to be 5).

What I want to know is how many unique orderings are possible, given the value of x and the conditions above.