Waste less time on Facebook — follow Brilliant.

Are there infinite configurations?

Now I will define a function \((n|k)\) as representing a certain amount of sets, \(c\) , where each set has \(k\) elements and the sum of all the elements equal to n. For example the sets defined with \((4|3)\) will be: \((1,1,2)\) \((1,2,1)\) \((2,1,1)\) Now there are \(3\) sets, so \(c = 3\). So I want to find out a general expression for c, the amount of sets possible.


Note by Harry Obey
9 months ago

No vote yet
1 vote


There are no comments in this discussion.


Problem Loading...

Note Loading...

Set Loading...