How many different ways can one hundred be written as a sum of at least two positive integers? – Project Euler

It is possible to write five as a sum in exactly six different ways:

4 + 1

3 + 2

3 + 1 + 1

2 + 2 + 1

2 + 1 + 1 + 1

1 + 1 + 1 + 1 + 1

How many different ways can one hundred be written as a sum of at least two positive integers?

I am guilty of writing this article as i have already written an article addressing this problem. But i made this seperate as these are problem listed on project Euler

Please Read my article on Integer Partition and Ferrers diagram

It should be noted that in Ferrers diagram the number itself is considered as one partition. But this specific problem asks for atleast 2 partitions.

### Like this:

Like Loading...

*Related*

Pingback: Readings on integer partitioning