This is causing me a bigger headache than I anticipated. Basically, given an integer N and a number M, I need a list of all the possible integer partitions of N into M parts such that each part is strictly positive and each part is UNIQUE. I don't want repetitions. Just unique ones. So for example, with N = 10 and M = 2 1 + 9 2 + 8 3 + 7 4 + 6 are the only possibilities. I tried to write a code to do it, but just ran into huge headaches because of the necessary recursion. With M > 2, you need to worry about systematically shifting the sequence as you go. Can anybody make a suggestion?