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.

Thanks

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

There are no comments in this discussion.