Skip to main content

All Questions

1 vote
1 answer
37 views

I want to obtain partition of an integer with an initial value and

I want to obtain a partition of an Integer with an initial value and the value following it is smaller and the value following it is smaller than the previous value and no value repeats itself. within ...
Zetock's user avatar
  • 31
0 votes
0 answers
28 views

Number of partitions with limited cardinality [duplicate]

We are given $k$ urns labeled from $1$ to $k$. What is the number of ways to put $n$ indistinguishable balls into the $k$ (distinct) urns, given that each urn has a limited capacity equal to $c$, ...
Let101's user avatar
  • 149
1 vote
2 answers
1k views

The number 3 can be written as $3$, $2+1$, $1+2$ or $1+1+1$ in four ways. In how many ways can the number $n$ be written?

Attempt Let $x$ be any variable $X+0=n ; X+Y=n ; X+Y+Z=n ; \dots; X+Y+Z+A+\dots=n$ (sum of n-1 terms); $1+1+1+.......+1=n$ (sum of n terms). So total number of ways= $$(n-1) C (1-1)+(n-1) C (2-1)+\...
Sangeeta's user avatar
0 votes
1 answer
58 views

Combination with Restriction and Repetition

I have a number $x$, let's say $5$, and I want to sort the number out into $4$ digits so that the sum of the digits is equal to $5$, but the value of each digit cannot exceed $3$. $0$ would be an ...
Popolok11's user avatar
0 votes
1 answer
54 views

Applying boundary conditions to counting combinatorial question [duplicate]

I was trying to count the number of natural number solutions to the equation: $x_1 + x_2 + ... + x_{11} = 20$, such that $0 \leq x_i \leq 9$, for all $i \in \{1, ..., 11\}$. I know how to apply the ...
Gauss's user avatar
  • 2,663
0 votes
0 answers
26 views

Making a group of $p$ people with $n$ available nationalities

Making a group of p people using m out of n available nationalities can be one of these two scenarios; $m \le p \le n$ or $m \le n \le p$. Using p,m, and n, how to evaluate the number of ways of ...
Hussain-Alqatari's user avatar
0 votes
0 answers
70 views

Number of ways to partition $\{1,2,3, \dots, N\}$ into tuples where the size of no tuple exceeds $3$.

While it seems to me that the general answer is not going to be a neat formula, I really only need this for $N=4$ and $N=5$. I'm getting $61$ and $321$ respectively, but I'm not sure. Please help.
user3460322's user avatar
1 vote
1 answer
951 views

Coin Combinations for any given scenario.

I am trying to work out the number of scenarios I can cover with a given set of coin combinations so I can decide when I have the optimal amount of change to carry. For the sake of the example, lets ...
Francis Rodgers's user avatar
2 votes
3 answers
1k views

Number of ways of cutting a stick such that the longest portion is of length n

We are given a stick of length $L$ (say). We make cuts such that the longest piece is of length $n$ (say) at most. What are the minimum number of pieces we will get and in how many ways this can be ...
Harsh Bhardwaj's user avatar
0 votes
2 answers
240 views

Number of solutions using partitions for linear equation having restrictions

Here is a linear equation $$a+b+c+d=12$$ where $a,b,c,d$ are restricted to be greater than zero and less than or equal to 6. How many set of positive integer solutions are possible using partitions ...
Subhash Chaganti's user avatar
5 votes
1 answer
4k views

How many permutations in S(n) have this particular type?

I'm working through the textbook A Course in Enumeration. In the section about permutations and Stirling numbers, I'm having trouble understanding problem 1.45. It is: We fix $n \in \mathbb{N}$, and ...
Tyler Durden's user avatar