Question

Combinatorial argument for solution of recursion behaving similarly as Pascals triangle?

score 151 · Answer 1 · 2019-03-18 08:31:05

151

Views

Combinatorial argument for solution of recursion behaving similarly as Pascals triangle?

Published on 18 Mar 2019 - 8:31

score 469 · Answer 2 · 2026-03-20 09:47:38

469

Views

Solving combinatorial problems with symbolic method and generating functions

Published on 20 Mar 2026 - 9:47

score 401 · Answer 3 · 2019-03-25 19:50:44

401

Views

Partial Matching and Augmenting Paths of Length 1

Published on 25 Mar 2019 - 19:50

score 563 · Answer 4 · 2019-03-30 21:45:42

563

Views

Combinatorial proof of $\binom{nk}{2}=k\binom{n}{2}+n^2\binom{k}{2}$

Published on 30 Mar 2019 - 21:45

score 403 · Answer 5 · 2026-03-25 12:50:53

403

Views

Prove: $[k+y-1-v]{v \choose k}\geq \sum_{j=0}^a(-1)^j \left( \sum_{i=0}^k{v-i \choose k-i}r_i(j)\right)+\epsilon(a,k,p)$

Published on 25 Mar 2026 - 12:50

score 37 · Answer 6 · 2019-04-07 02:43:25

37

Views

Proof by induction: summation inductive step

Published on 07 Apr 2019 - 2:43

score 245 · Answer 7 · 2019-04-11 01:13:32

245

Views

Combinatorial proof of $\sum_{j=0}^{k} \binom{n}{j} = \sum_{j=0}^k \binom{n-1-j}{k-j}2^j$

Published on 11 Apr 2019 - 1:13

score 751 · Answer 8 · 2019-04-11 18:23:29

751

Views

Prove your identity using a block-walking argument.

Published on 11 Apr 2019 - 18:23

score 310 · Answer 9 · 2019-04-17 16:53:58

310

Views

Combinatorial proof $\sum_i^{\lfloor{n/2}\rfloor} (-1)^i {n-i\choose i} 2^{n-2i} = n+1$

Published on 17 Apr 2019 - 16:53

score 148 · Answer 10 · 2019-04-21 21:25:45

148

Views

Combinatorics Proof of $\sum_{i=0}^n \sum_{j=0}^{i-1} j = {n+1 \choose 3}$

Published on 21 Apr 2019 - 21:25

score 1.1k · Answer 11 · 2019-04-22 12:21:21

1.1k

Views

Combinatorial proof of fibonacci

Published on 22 Apr 2019 - 12:21

score 552 · Answer 12 · 2019-04-23 18:33:42

552

Views

Combinatorial proof for $\sum_{k=0}^p (-1)^k {n \choose k} = (-1)^p {n-1 \choose p}$

Published on 23 Apr 2019 - 18:33

score 1.1k · Answer 13 · 2026-03-25 02:29:22

1.1k

Views

Partitions of a set with n elements (proof)

Published on 25 Mar 2026 - 2:29

score 1.5k · Answer 14 · 2019-04-25 05:55:04

1.5k

Views

How do I prove this combinatorial identity

Published on 25 Apr 2019 - 5:55

score 287 · Answer 15 · 2019-05-02 18:21:21

287

Views

Bijection between "circularly nonconsecutive" permutations and permutations with one fixed point

Published on 02 May 2019 - 18:21

List Question

Combinatorial argument for solution of recursion behaving similarly as Pascals triangle?

Solving combinatorial problems with symbolic method and generating functions

Partial Matching and Augmenting Paths of Length 1

Combinatorial proof of $\binom{nk}{2}=k\binom{n}{2}+n^2\binom{k}{2}$

Prove: $[k+y-1-v]{v \choose k}\geq \sum_{j=0}^a(-1)^j \left( \sum_{i=0}^k{v-i \choose k-i}r_i(j)\right)+\epsilon(a,k,p)$

Proof by induction: summation inductive step

Combinatorial proof of $\sum_{j=0}^{k} \binom{n}{j} = \sum_{j=0}^k \binom{n-1-j}{k-j}2^j$

Prove your identity using a block-walking argument.

Combinatorial proof $\sum_i^{\lfloor{n/2}\rfloor} (-1)^i {n-i\choose i} 2^{n-2i} = n+1$

Combinatorics Proof of $\sum_{i=0}^n \sum_{j=0}^{i-1} j = {n+1 \choose 3}$

Combinatorial proof of fibonacci

Combinatorial proof for $\sum_{k=0}^p (-1)^k {n \choose k} = (-1)^p {n-1 \choose p}$

Partitions of a set with n elements (proof)

How do I prove this combinatorial identity

Bijection between "circularly nonconsecutive" permutations and permutations with one fixed point

Trending Questions

Popular # Hahtags

Popular Questions