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

  • Thread starter Thread starter mathworker
  • Start date Start date
  • Tags Tags
    Combinatorics
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.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Back
Top