Question

Last six digits of $\left\lfloor\frac{302000002!}{e}\right\rfloor$.

score 61 · Answer 1 · 2020-04-18 00:01:38

Last six digits of $\left\lfloor\frac{302000002!}{e}\right\rfloor$.

Published on 18 Apr 2020 - 0:01

score 497 · Answer 2 · 2020-04-24 20:12:25

$5$ guests leave their coats in the hall. Each takes a fur coat at random when they leave. What's the probability that every coat was someone else's?

score 63 · Answer 3 · 2020-05-11 08:09:12

63

Views

Number of derangements on $[n]$ when there exists an extra limitation

Published on 11 May 2020 - 8:09

score 118 · Answer 4 · 2020-05-11 12:19:36

118

Views

How many derangements on a set $[n]$ does there exist such that $\sigma(n)\ne n-1$ and $\sigma(n-1)\ne n-2$

Published on 11 May 2020 - 12:19

score 249 · Answer 5 · 2020-05-12 09:08:25

249

Views

How many derangements on a set $[n]$ does there exist such that $\sigma(n)\ne n-1$ ,$\sigma(n-1)\ne n-2$,$\sigma(n-2)\ne n-3$

Published on 12 May 2020 - 9:08

score 240 · Answer 6 · 2020-05-14 14:43:52

240

Views

A special case of double derangement with $ k-1 \ne\sigma(k) \ne k $

Published on 14 May 2020 - 14:43

score 962 · Answer 7 · 2020-05-14 14:59:25

962

Views

Number of permutation such that $\sigma (k) \ne k-1$

Published on 14 May 2020 - 14:59

score 462 · Answer 8 · 2020-05-14 15:10:33

462

Views

Double derangement and the other unfamous kind of derangement

Published on 14 May 2020 - 15:10

score 220 · Answer 9 · 2020-05-15 12:27:13

220

Views

Are $n!=\sum_{k=0}^{n}kD_{n,k}$ and $n!=\sum_{k=0}^{n}\left(k-1\right)^{2}D_{n,k}$ true?

Published on 15 May 2020 - 12:27

score 61 · Answer 10 · 2020-05-16 02:44:40

61

Views

How can I fix this solution regarding the expression for $D_n$?

Published on 16 May 2020 - 2:44

score 41 · Answer 11 · 2020-05-16 15:17:50

41

Views

In how many ways are we able to permute a set $[n]$ such that for each $2\le k\le n$: $\sigma(k) \ne k-1$

Published on 16 May 2020 - 15:17

score 105 · Answer 12 · 2020-05-18 09:06:46

105

Views

In a class of $m$ students, what is the chance that $n$ will receive their own exam back?

Published on 18 May 2020 - 9:06

score 94 · Answer 13 · 2020-05-19 15:53:32

94

Views

Laisant’s recurrence relation

Published on 19 May 2020 - 15:53

score 62 · Answer 14 · 2020-06-03 14:55:55

62

Views

Question on Derangement.

Published on 03 Jun 2020 - 14:55

score 54 · Answer 15 · 2020-06-05 21:34:15

54

Views

Determine a matrix from terms of Leibniz formula

Published on 05 Jun 2020 - 21:34

List Question

Last six digits of $\left\lfloor\frac{302000002!}{e}\right\rfloor$.

$5$ guests leave their coats in the hall. Each takes a fur coat at random when they leave. What's the probability that every coat was someone else's?

Number of derangements on $[n]$ when there exists an extra limitation

How many derangements on a set $[n]$ does there exist such that $\sigma(n)\ne n-1$ and $\sigma(n-1)\ne n-2$

How many derangements on a set $[n]$ does there exist such that $\sigma(n)\ne n-1$ ,$\sigma(n-1)\ne n-2$,$\sigma(n-2)\ne n-3$

A special case of double derangement with $ k-1 \ne\sigma(k) \ne k $

Number of permutation such that $\sigma (k) \ne k-1$

Double derangement and the other unfamous kind of derangement

Are $n!=\sum_{k=0}^{n}kD_{n,k}$ and $n!=\sum_{k=0}^{n}\left(k-1\right)^{2}D_{n,k}$ true?

How can I fix this solution regarding the expression for $D_n$?

In how many ways are we able to permute a set $[n]$ such that for each $2\le k\le n$: $\sigma(k) \ne k-1$

In a class of $m$ students, what is the chance that $n$ will receive their own exam back?

Laisant’s recurrence relation

Question on Derangement.

Determine a matrix from terms of Leibniz formula

Trending Questions

Popular # Hahtags

Popular Questions