All Questions
1
question
3
votes
1
answer
1k
views
What is the count of the strict partitions of n in k parts not exceeding m?
Lets say we had a $k,m,n \in \mathbb{N}$ where $k < m \le n$. How many different sets $X_1,..,X_m$ with $|X_i|=k$ for $i=1,..,m$, where the sets do not include duplicates, for which the sum of ...
- 43