What's it called when you want to decompose an integer into only 3 numbers that add up to the original?
Some examples include:
6 -> Only 1,2,3
9 has (1,1,7), (1,2,6), (1,3,5), (1,4,4), (2,2,5), (2,3,4), (3,3,3)
pic probably not related
>>9100698
Partition of a number, N, into exactly 3 parts.
Incidentally the number of ways to do this is the same as the number of partitions of N whose largest part is 3.
>>9100831
>incidentally
Boy you need number theory
Partioning a number n into m parts kan be done in (n-m-1)C(m-1) ways
>>9100698
6-> (1,2,3), (1,1,4) btw
>>9100960
Shit, I missed that one.