Stats
65,118
reputation
9k
reached
13
answers
1
question
Loading…
About
Turn-ons: game theory, combinatorics, probability, progressive rock.
Turn-offs: that feeling when someone rubs paper on chalkboard.
Algorithm to compute number ordered selections w/ upper bound restrictions:
Canonical duplicate: How to find the number of $k$-permutations of $n$ objects with $x$ types, and $r_1, r_2, r_3, \cdots , r_x$ = the number of each type of object?
My algorithmic approach: permutation of a subset from a set with multiple repetitions
Unordered version:
Zeilberger quick how-to:https://math.stackexchange.com/a/4322239
How to ask a good question advice: https://math.meta.stackexchange.com/a/34067
Badges
View all badges
This user doesn’t have any gold badges yet.
10
silver badges
-
Good AnswerFeb 8
-
EnlightenedMar 29, 2021
-
Yearling
× 8Sep 20
12
bronze badges
-
ExcavatorJul 2, 2021
-
CommentatorApr 10, 2021
-
TeacherDec 13, 2014
Top tags
View all tags
92
Score
9
Posts
64
Posts %
40
Score
5
Posts
36
Posts %
25
Score
1
Posts
7
Posts %
25
Score
1
Posts
7
Posts %
20
Score
1
Posts
7
Posts %
14
Score
2
Posts
14
Posts %