New posts in Combinatorial Proofs

A power series equality involving binomial coefficients

How to calculate a combinatorial sum

A Combinatorial/Algebraic Solution to Combinatorics Identities Exercise

Can this be proved using Combinatorics or generating functions?

if $n>0$ and $r>0$ ($n$ and $r$ and positive integers) and $r$ divides $n$ , then $n/r$ divides $nCr$ . Is this statement true?

Trailing zeroes of $\dfrac{n!}{m!}$ for $n>m$

Combinatoric meaning to $1+2+\dots+n=\frac{n(n+1)}{2}= {n+1 \choose 2}$

Prove $\sum_{m=i}^{n}2^{n-m}\binom{m}{i}=\binom{n+1}{i+1}+\ldots+\binom{n+1}{n+1}=\sum_{m=i}^{n}\binom{n+1}{m+1}$ without induction

Proving $\log\left(\frac{4^n}{\sqrt{2n+1}{2n\choose n+m}}\right)\geq \frac{m^2}{n}$

Is there an explicit construction of this bijection?