Hi all,(adsbygoogle = window.adsbygoogle || []).push({});

I'm new to the forum, this is my problem:

given a positive integer n, i want to find how many combinations of integers smaller than n but larger than 0 sum to n. E.g.

n=3:

{3},{2,1},{1,1,1}

n=4:

{4},{3,1},{2,2},{2,1,1},{1,1,1}

it might just be that i'm tired, but i've been thinking about this for a while.

Thank you very much!

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Number of combinations of integers \leq n which sum to n

Loading...

Similar Threads for Number combinations integers |
---|

I Repeatability of necessity: number restrictions? |

B Problem in Counting - Number of Passwords |

I Partitioning a whole number in a particular way |

I Combination of Non Adjacent Numbers |

I Problem with infinite decimal numbers? |

**Physics Forums | Science Articles, Homework Help, Discussion**