How many combinations of r natural numbers add up to n?

  • Context: MHB 
  • Thread starter Thread starter mathworker
  • Start date Start date
  • Tags Tags
    Combinatorics
Click For Summary

Discussion Overview

The discussion revolves around the problem of determining the number of combinations of \( r \) natural numbers that sum to \( n \). It explores concepts related to integer partitions, restricted partition functions, and the distinction between combinations and permutations in this context.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant seeks to find the number of combinations of \( r \) natural numbers that add up to \( n \), expressing difficulty in solving the problem.
  • Another participant identifies this problem as related to the concept of integer partitions and references a webpage and a book by Ivan Niven for further reading.
  • A participant questions the applicability of the partition function, noting it does not provide the number of partitions of a specific cardinality \( r \) and inquires about defining a restricted partition function for this purpose.
  • One participant provides an example of the number of partitions of 6 into 3 summands, illustrating the concept with a specific case and mentioning a recursive definition of \( p_k(n) \).
  • A different participant highlights the potential confusion in terminology, distinguishing between combinations (sets) and permutations (ordered sequences), and mentions a related discussion on StackExchange.

Areas of Agreement / Disagreement

Participants express differing views on the applicability of the partition function and whether a restricted version can be defined. There is no consensus on how to approach the problem or the definitions involved.

Contextual Notes

Participants note limitations in the existing literature regarding the specific cardinality of partitions and the definitions of combinations versus permutations, which may affect the clarity of the discussion.

mathworker
Messages
110
Reaction score
0
Find the number of different combinations of $$r$$ natural.numbers that add upto $$n$$

I tried this for quite a fair amount.of.time but.couldn't figure it out.(Punch)
 
Last edited:
Physics news on Phys.org
Re: a tough combonotrics problem

mathworker said:
Find the number of different combinations of $$r$$ natural.numbers that add upto $$n$$

I tried this for quite a fair amount.of.time but.couldn't figure it out.

This is known as the problem of Partitions of an Integer.
Here is a fair webpage on the topic.

If you want print material see Ivan Niven's Mathematics of Choice, chapter six.
 
Thanks for the link,I have gone through it.
But as far as I understood partition function doesn't give the number of partitions of specific cardinality.I mean if we want only the partitions that contains $$r$$ terms for example or can we define a restricted partition function that can do the job?If we can define how can we approximate such restricted $$p(x)$$
 
mathworker said:
Thanks for the link,I have gone through it.
But as far as I understood partition function doesn't give the number of partitions of specific cardinality.I mean if we want only the partitions that contains $$r$$ terms for example or can we define a restricted partition function that can do the job?If we can define how can we approximate such restricted $$p(x)$$

Well I did say that the webpage is only fair. I dislike its notation.
I suggest that you try to find Niven's book.

Example: The number of partitions of 6 into 3 summands is three:
\begin{align*} 6 &= 1+1+4\\ &=1+2+3\\ &=2+2+2\end{align*}

That is p_3(6)-p_2(6).

There is a clear recursive definition of p_k(n).
 
mathworker said:
Find the number of different combinations of $$r$$ natural.numbers that add upto $$n$$
There is a page in StackExchange about this. Of course, the problem is tricky if "combination" is used in its technical sense to mean a set. In contrast, permutations (i.e., ordered sequences) of summands are called compositions (rather than partitions). Their number is simple to figure out.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
7K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 29 ·
Replies
29
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K