Question

Deranged generous gift giving in the limit

score 76 · Answer 1 · 2023-07-02 12:32:35

76

Views

Deranged generous gift giving in the limit

Published on 02 Jul 2023 - 12:32

score 18 · Answer 2 · 2023-07-08 13:38:45

18

Views

Derangement with a limit of minimum distance

Published on 08 Jul 2023 - 13:38

score 83 · Answer 3 · 2023-08-17 14:41:30

83

Views

The number of ways to arrange 8 rooks on the chessboard satisfying the condition

Published on 17 Aug 2023 - 14:41

score 114 · Answer 4 · 2023-08-18 11:53:46

114

Views

Counting $\{a,a,b,b,c,c,d,d,d \}$ derangements.

Published on 18 Aug 2023 - 11:53

score 122 · Answer 5 · 2023-08-18 17:06:30

122

Views

Bijection between derangements and permutations whose first ascent is in even position

Published on 18 Aug 2023 - 17:06

score 28 · Answer 6 · 2023-09-05 15:08:04

28

Views

Proof of the derangement theorem

Published on 05 Sep 2023 - 15:08

score 68 · Answer 7 · 2023-09-14 02:36:15

For counting the number of derangements, does it matter whether we preclude fixed points or just an item being at any unique index for the count?

score 82 · Answer 8 · 2023-09-15 18:06:25

82

Views

Confused about this proof for derangements formula $n ! \sum_{k=0}^n \frac{(-1)^k}{k !} $

Published on 15 Sep 2023 - 18:06

score 780 · Answer 9 · 2023-09-18 03:25:18

780

Views

The n-person hat matching problem in probability for n=3, doesn't match derangement formula

Published on 18 Sep 2023 - 3:25

score 63 · Answer 10 · 2023-09-29 06:44:23

63

Views

The matching problem in a recursive view

Published on 29 Sep 2023 - 6:44

score 87 · Answer 11 · 2023-09-29 10:58:23

87

Views

Show $P_n = \frac{1}{2!} - \frac{1}{3!} + \frac{1}{4!} - \dots + \frac{(-1)^n}{n!}$ given $P_n = \frac{n-1}{n} P_{n-1} + \frac1n P_{n-2}$

Published on 29 Sep 2023 - 10:58

score 60 · Answer 12 · 2023-09-29 22:17:03

60

Views

Matching problem in a recursive way

Published on 29 Sep 2023 - 22:17

score 47 · Answer 13 · 2023-12-30 04:11:04

47

Views

The range of the probability of the derangement for $n$ people

Published on 30 Dec 2023 - 4:11

score 106 · Answer 14 · 2024-01-15 23:12:44

106

Views

How many one to one functions f: A→A have at least one fixed point?

Published on 15 Jan 2024 - 23:12

score 151 · Answer 15 · 2024-03-09 14:23:02

151

Views

Reference for a combinatorial identity involving the number of derangements

Published on 09 Mar 2024 - 14:23

List Question

Deranged generous gift giving in the limit

Derangement with a limit of minimum distance

The number of ways to arrange 8 rooks on the chessboard satisfying the condition

Counting $\{a,a,b,b,c,c,d,d,d \}$ derangements.

Bijection between derangements and permutations whose first ascent is in even position

Proof of the derangement theorem

For counting the number of derangements, does it matter whether we preclude fixed points or just an item being at any unique index for the count?

Confused about this proof for derangements formula $n ! \sum_{k=0}^n \frac{(-1)^k}{k !} $

The n-person hat matching problem in probability for n=3, doesn't match derangement formula

The matching problem in a recursive view

Show $P_n = \frac{1}{2!} - \frac{1}{3!} + \frac{1}{4!} - \dots + \frac{(-1)^n}{n!}$ given $P_n = \frac{n-1}{n} P_{n-1} + \frac1n P_{n-2}$

Matching problem in a recursive way

The range of the probability of the derangement for $n$ people

How many one to one functions f: A→A have at least one fixed point?

Reference for a combinatorial identity involving the number of derangements

Trending Questions

Popular # Hahtags

Popular Questions