# 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.

Thanks

Note by Harry Obey
2 years, 2 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

• bulleted
• list

1. numbered
2. list

1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

> This is a quote
This is a quote
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$