Max Math Problem

    Apr 06 2011 | 5:06 am
    I have a set of ten numbers and I want to know all the possible sums of each other are. I need to know what n1 + n2 is and what n1 + n3 is up to n10, but also what n1+n2+n3 is and what n1+n2+n4 is etc...
    ive been thinking of it as kind of a binary addition: 1000000000 0100000000 1100000000 0010000000 and so forth...
    but it may just be too late after a long day but I'm having some real trouble coming up with a practical way to do this... patching the logic for it would be mind numbing, and I don't know of any algorithms to do this... any thoughts?

    • Apr 06 2011 | 7:31 am
      Good morning. Like this?
    • Apr 06 2011 | 4:29 pm
      Morning jvkr!
      Thanks for the quick reply. @ work right now so I was only able to get a runtime look at the patch, but it seem to work just like i need, and elegantly with few objects :)
      Once I can unlock the patch I just would need to check out the order of the calculations so I can sort/categorize them.
      Thanks again!