Advanced Search

Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let p > 3 be a prime. We show that $T_{p-1}\equiv (p/3)3^{p-1}\left(modp²\right)$, where the central trinomial coefficient Tₙ is the constant term in the expansion of $(1+x+x^{-1})ⁿ$. We also prove three congruences modulo p³ conjectured by Sun, one of which is ${\sum }_{k=0}^{p-1}\left(\genfrac{}{}{0pt}{}{p-1}{k}\right)\left(\genfrac{}{}{0pt}{}{2k}{k}\right)({(-1)}^k-{(-3)}^{-k})\equiv (p/3)(3^{p-1}-1)\left(modp³\right)$. In addition, we get some new combinatorial identities.

We discuss some cancellation algorithms such that the first non-cancelled number is a prime number p or a number of some specific type. We investigate which numbers in the interval (p,2p) are non-cancelled.