Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with permutations
Search options not deleted
user 104738
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
3
votes
1
answer
558
views
(Approximate) Number of ways to partition $n$ elements into ordered subsets of bounded size
Given positive integers $n$ and $c$, with $n>c$, is there a good way to estimate the number of ways to partition the set $\{1,\dots,n\}$ into ordered subsets, with each subset having at most $c$ eleme …
- 33