Question

Why is the following not $S(n,3)$ where $S(n,k)$ is a Stirling number of the second kind? (almost solved)

score 118 · Answer 1 · 2026-03-29 14:25:11

118

Views

Why is the following not $S(n,3)$ where $S(n,k)$ is a Stirling number of the second kind? (almost solved)

Published on 29 Mar 2026 - 14:25

score 140 · Answer 2 · 2021-09-10 19:36:01

140

Views

Partitioning into products

Published on 10 Sep 2021 - 19:36

score 27 · Answer 3 · 2021-09-13 09:07:21

27

Views

Number of partitions of a positive integer with largest part not exceeding k

Published on 13 Sep 2021 - 9:07

score 410 · Answer 4 · 2026-03-29 15:54:56

410

Views

Given a set of both positive and negative numbers, what is a time optimal approach to find the two numbers whose sum, plus a third number is zero

Published on 29 Mar 2026 - 15:54

score 81 · Answer 5 · 2021-09-26 12:00:55

81

Views

Sum of how many numbers should N be partitioned.

Published on 26 Sep 2021 - 12:00

score 127 · Answer 6 · 2021-10-01 07:43:18

127

Views

Understanding a solution of USAMO 1999 (Integers having numerous partitions of a certain type)

Published on 01 Oct 2021 - 7:43

score 129 · Answer 7 · 2026-03-31 10:13:53

129

Views

Let g_n equal the number of lists of any length taken from {1,3,4} having elements that sum to n.

Published on 31 Mar 2026 - 10:13

score 115 · Answer 8 · 2021-10-07 14:42:46

115

Views

Partition function of multi-particle canonical ensemble

Published on 07 Oct 2021 - 14:42

score 78 · Answer 9 · 2021-10-11 07:59:00

78

Views

Partitions of $n$ where every element of the partition is different from 1 is $p(n)-p(n-1)$

Published on 11 Oct 2021 - 7:59

score 74 · Answer 10 · 2021-10-11 12:28:39

74

Views

Identity with integer partitions

Published on 11 Oct 2021 - 12:28

score 143 · Answer 11 · 2021-10-12 11:03:57

143

Views

"On the Probability of Sequences in the Genoese Lottery" by Euler. How did he do it?

Published on 12 Oct 2021 - 11:03

score 89 · Answer 12 · 2021-10-16 04:45:07

89

Views

Prove combinatorially the recurrence $p_n(k) = p_n(k−n) + p_{n−1}(k−1)$ for all $0<n≤k$.

Published on 16 Oct 2021 - 4:45

score 72 · Answer 13 · 2021-10-18 23:24:45

Partition of $N$ into integers $a_1,\cdots a_M$ for fixed $M$: how to define an index on [0,1] closest to 1 when the $a_i$ are almost the same?

score 32 · Answer 14 · 2026-03-29 04:48:19

32

Views

Partition With Ranking to Solve A Clustering Problem

Published on 29 Mar 2026 - 4:48

score 26 · Answer 15 · 2021-10-29 06:01:26

26

Views

Distribution of integer partitions by number of parts

Published on 29 Oct 2021 - 6:01

List Question

Why is the following not $S(n,3)$ where $S(n,k)$ is a Stirling number of the second kind? (almost solved)

Partitioning into products

Number of partitions of a positive integer with largest part not exceeding k

Given a set of both positive and negative numbers, what is a time optimal approach to find the two numbers whose sum, plus a third number is zero

Sum of how many numbers should N be partitioned.

Understanding a solution of USAMO 1999 (Integers having numerous partitions of a certain type)

Let g_n equal the number of lists of any length taken from {1,3,4} having elements that sum to n.

Partition function of multi-particle canonical ensemble

Partitions of $n$ where every element of the partition is different from 1 is $p(n)-p(n-1)$

Identity with integer partitions

"On the Probability of Sequences in the Genoese Lottery" by Euler. How did he do it?

Prove combinatorially the recurrence $p_n(k) = p_n(k−n) + p_{n−1}(k−1)$ for all $0<n≤k$.

Partition of $N$ into integers $a_1,\cdots a_M$ for fixed $M$: how to define an index on [0,1] closest to 1 when the $a_i$ are almost the same?

Partition With Ranking to Solve A Clustering Problem

Distribution of integer partitions by number of parts

Trending Questions

Popular # Hahtags

Popular Questions