We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
the logis is: numbers of the form ½m(3m − 1), where m is an integer. The signs in the summation alternate as (-1)^{m}. This theorem can be used to derive a recurrence for the partition function:
Project Euler #78: Coin partitions
You are viewing a single comment's thread. Return to all comments →
This is a partition function(number theory)
the logis is: numbers of the form ½m(3m − 1), where m is an integer. The signs in the summation alternate as (-1)^{m}. This theorem can be used to derive a recurrence for the partition function:
where p(0) is taken to equal 1, and p(k) is taken to be zero for negative k.
http://en.wikipedia.org/wiki/Partition_%28number_theory%29