Skip to main content

Questions tagged [derangements]

For questions on derangements, permutations of a set without fixed points.

0 votes
2 answers
190 views

If there are 8 letters numbered 1 1 2 3 4 5 6 7 (not 12345678) instead there is one 1 extra and similarly there are envlopes numbered 1 1 2 3 4 5 6 7 assuming that the two letters and the two ...
Marvelmaanas12's user avatar
1 vote
1 answer
90 views

How can I derive $\boxed{ !n = \left\lfloor \dfrac{n!+1}{e} \right\rfloor,~~~ n \ge 1 }~?$ It is $\boxed{ !n =n! \displaystyle\sum\limits_{k=0}^{n} \dfrac{(-1)^k}{k!} }$ (wikipedia). So I tried ...
cis's user avatar
  • 229
2 votes
3 answers
141 views

I have seen some posts here computing the probability of a derangement by first counting the derangements. I would like to know why my attempt to compute the probability directly failed and what I did ...
FNB's user avatar
  • 469
0 votes
3 answers
184 views

I gave the Indian Olympiad Qualifier in Mathematics (IOQM) 2025, on September 7th. Following is a combinatorics problem from the exam as follows: There are 6 coupons numbered from 1 to 6 and 6 ...
Darsh Darsh's user avatar
3 votes
1 answer
169 views

I'm trying to figure out the value of the following sum, $S_n$. It's defined over a set $H_n$ which contains integer partitions of $n$ using only parts of size 2 or greater. Here are the definitions: $...
匚ㄖㄥᗪ乇ᗪ's user avatar
0 votes
0 answers
66 views

I’m interested in counting permutations of the set $\{1,\ldots, n\}$ with two restrictions: No element appears in its original position (i.e., derangements). No two consecutive integers appear next to ...
NotEinstein's user avatar
0 votes
1 answer
86 views

image Two sheep and three goats live on a farm. At feeding time, the farmer puts out two bowls of sheep food and three bowls of goat food. How many ways are there for the animals to eat from the bowls,...
user avatar
2 votes
1 answer
170 views

This problem is taken from A first course in probability by Sheldon Ross. Problem Statement Suppose that each of the N men at a party throws his hat into the center of the room, then each man randomly ...
Mystic mystic's user avatar
10 votes
1 answer
375 views

UPDATE. The case of geometric distributions seems to be solved: I think we have that for all $\lambda \in (0,1)$, $\mathbb{P}_{p_\lambda}(D(\mathbb{N})) = 0$. But the fundamental question that remains ...
Julian Newman's user avatar
0 votes
1 answer
220 views

Let $A$ be the set of the first seven natural numbers; let $B$ be the set of the first six even natural numbers. Consider functions $f: A \to B$ such that $f(x) \neq 2x~\forall x \in A$ and $f(x)$ is ...
匚ㄖㄥᗪ乇ᗪ's user avatar
3 votes
1 answer
152 views

Let $\gamma\in[0,1]$. Consider the subset $A_{n}=\{1,2,...,\lceil n\gamma\rceil\}\subseteq \{1,2,...,n\}$. Let $\sigma$ be permutation of the set $\{1,2,...n\}$ chosen uniformly and randomly. Let $X_{...
Dovahkiin's user avatar
  • 1,666
3 votes
1 answer
142 views

Let $P(n)$ denote the number of ways to put $n$ items in an $n \times n$ grid so there is exactly one item in every row, column, and both major diagonals. Thus, $P(n) = |\{\sigma \in S_n : \exists! \...
Perry Ainsworth's user avatar
7 votes
0 answers
304 views

Trying to resolve my last question, I stumbled on this sequence, A288208, which resolves the case $k=3$. I see that there are various codes proposed to compute the sequence, but there isn't a closed ...
user967210's user avatar
  • 1,518
5 votes
2 answers
263 views

There is a table at the bottom of the wikipedia article on deranged permutations, where the number of derangements for $1,...,30$ is listed. I noticed that the last digit of $!n$ is zero only when the ...
polfosol's user avatar
  • 10k
6 votes
1 answer
268 views

It is widely known considering the set $\{1,2,\cdots,\ n\}$ that $ \lim_{n\to\infty}\frac{n!}{!n}=e$ where $!n$ are the derangements. Less known is the fact that defining $a_n$ as the number of ...
user967210's user avatar
  • 1,518

15 30 50 per page
1
2 3 4 5
17