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
SUMMARY

The discussion centers on finding the number of combinations of \( r \) natural numbers that sum to \( n \), a problem known as the Partitions of an Integer. Participants highlight that the standard partition function does not provide the number of partitions of a specific cardinality, leading to inquiries about defining a restricted partition function. An example illustrates that the number of partitions of 6 into 3 summands is three, emphasizing the need for a recursive definition of \( p_k(n) \). The distinction between combinations and permutations is also clarified, with permutations referred to as compositions.

PREREQUISITES
  • Understanding of integer partitions and combinatorial mathematics.
  • Familiarity with the partition function and its properties.
  • Knowledge of recursive definitions in mathematical functions.
  • Basic concepts of combinations and permutations in combinatorics.
NEXT STEPS
  • Research the properties of the partition function \( p(n) \) and its applications.
  • Explore restricted partition functions and their definitions.
  • Learn about recursive definitions in combinatorial contexts.
  • Study the differences between combinations and compositions in combinatorics.
USEFUL FOR

Mathematicians, combinatorial theorists, and students studying number theory who are interested in integer partitions and their applications in combinatorial problems.

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 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
974
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 29 ·
Replies
29
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 21 ·
Replies
21
Views
8K