Related papers: Super-congruences involving trininomial coefficien…

Let $M_n$ and $T_n$ denote the $n$th Motzkin number and the $n$th central trinomial coefficient respectively. We prove that for any prime $p\ge 5$, \begin{align*} &\sum_{k=0}^{p-1}M_k^2\equiv…

Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

A generalized central trinomial coefficient $T_n(b,c)$ is the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$ with $b,c\in\mathbb Z$. In this paper we investigate congruences and series for sums of terms related to central binomial…

In this paper, we state and prove some congruence properties for the trinomial coeficients, one of which is similar to the Wolstenholme's theorem.

We present a relationship between the generalized hyperharmonic numbers and the poly-Bernoulli polynomials, motivated from the connections between harmonic and Bernoulli numbers. This relationship yields numerous identities for the…

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…

By using the Rodriguez-Villegas-Mortenson supercongruences, we prove four supercongruences on sums involving binomial coefficients, which were originally conjectured by Sun. We also confirm a related conjecture of Guo on integer-valued…

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

It is shown that for any prime $p$ and any natural numbers $\ell, m,$ and $s$ such that $0<s<p$, the three following congruences \begin{align*}\sum_{i\ge \ell+1}(-1)^{m-i} {m \choose i}{m+s-1+i(p-1) \choose m+s-1+\ell(p-1)} &\equiv 0 \bmod…

Let $p$ be a prime. In this short note we study some families of super congruences involving the following alternating sums \begin{equation*} \sum_{\substack{j_1+j_2+\cdots+j_n=2 p^r p\nmid j_1 j_2 \cdots j_n}}…

Let $p>3$ be a prime, and let $a$ be a rational p-adic integer. Let $\{B_n(x)\}$ and $\{E_n(x)\}$ denote the Bernoulli polynomials and Euler polynomials, respectively. In this paper we show that $$\sum_{k=0}^{p-1}\binom…

We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.

In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…

Recently the first author proved a congruence proposed in 2006 by Adamchuk: $\sum_{k=1}^{\lfloor\frac{2p}{3}\rfloor}\binom{2k}{k}\equiv 0\pmod{p^2}$ for any prime $p=1 \pmod{3}$. In this paper, we provide more examples (with proofs) of…

Let $p$ be a prime and ${\mathcal{P}_{p}}$ the set of positive integers which are prime to $p$. We establish the following interesting congruence \[\sum\limits_{\begin{smallmatrix} i+j+k={{p}^{r}} i,j,k\in {\mathcal{P}_{p}}…

Using an intrinsic $q$-hypergeometric strategy, we generalise Dwork-type congruences $H(p^{s+1})/H(p^s)\equiv H(p^s)/H(p^{s-1})\pmod{p^3}$ for $s=1,2,\dots$ and $p$ a prime, when $H(N)$ are truncated hypergeometric sums corresponding to the…

In the present paper we obtain several new results related to the problem of upper bound estimates for the number of solutions of the congruence $$ x^{x}\equiv \lambda\pmod p;\quad x\in \mathbb{N},\quad x\le p-1, $$ where $p$ is a large…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…