Skip to main content
awenner's user avatar
awenner's user avatar
awenner's user avatar
awenner
  • Member for 14 years, 3 months
awarded
awarded
comment
How many ways are there to express 'n' as the sum of 'm' nonzero whole number?
Thanks for the pointers -- I'll read up a little more on integer partitions before I repost the question at stackexchange. That said, in my question order does NOT matter -- ie, [1-1-3] == [3-1-1]. That's what makes this slightly different than a binomial coefficient. As usual, it seems like knowing the name of the problem category is a good first start!
Loading…