I'm trying to design this computer program that will take a given number and find the number of ways it can be added up. For example, if given the number 3, we can say there's 3 different ways it can be added up: 1+2,2+1, and 1+1+1. The computer programming part isn't really what I'm having trouble with, its more of the mathematics behind it. How could I create a function that does this? Can anyone provide some insight as to how to approach this?
A wikipedia article exists on the topic but I'm not sure it helped me so much: http://en.wikipedia.org/wiki/Partition_function_(number_theory)#Asymptotic_behaviour
A wikipedia article exists on the topic but I'm not sure it helped me so much: http://en.wikipedia.org/wiki/Partition_function_(number_theory)#Asymptotic_behaviour