Related papers: Products and sums divisible by central binomial co…

Let $p$ be a prime and let $a$ be a positive integer. In this paper we investigate $\sum_{k=0}^{p^a-1}\binom[(h+1)k,k+d]/m^k$ modulo a prime $p$, where $d$ and $m$ are integers with $-h<d<=p^a$ and $m\not=0 (mod p)$. We also study…

In this paper, we prove the following result conjectured by Z.-W. Sun: $$ (2n-1){3n\choose n}| \sum_{k=0}^{n}{6k\choose 3k}{3k\choose k}{6(n-k)\choose 3(n-k)}{3(n-k)\choose n-k}. $$ by showing that the left-hand side divides each summand on…

This paper studies properties of the integer sequence $\overline{\overline{G}}_n=\prod_{k=0}^n\binom{n}{k}_{\mathbb{Z},\mathbb{N}}$ which is analogous to $\overline{G}_n=\prod_{k=0}^n\binom{n}{k}$, the product of the elements of the $n$-th…

We evaluate some series with summands involving a single binomial coefficient $\binom{6k}{3k}$. For example, we prove that $$\sum_{k=0}^\infty\frac{(63k^2+78k+22)8^k}{(2k+1)(6k+1)(6k+5)\binom{6k}{3k}}=\frac{3\pi}2.$$ Motivated by Galois…

The balancing numbers $B_n$ ($n=0,1,\cdots$) are solutions of the binary recurrence $B_n=6B_{n-1}-B_{n-2}$ ($n\ge 2$) with $B_0=0$ and $B_1=1$. In this paper we show several relations about the sums of product of two balancing numbers of…

In this paper we consider combinatorial numbers $C_{m, k}$ for $m\ge 1$ and $k\ge 0$ which unifies the entries of the Catalan triangles $ B_{n, k}$ and $ A_{n, k}$ for appropriate values of parameters $m$ and $k$, i.e., $B_{n,…

We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…

We explore new types of binomial sums with Fibonacci and Lucas numbers. The binomial coefficients under consideration are $\frac{n}{n+k}\binom{n+k}{n-k}$ and $\frac{k}{n+k}\binom{n+k}{n-k}$. The identities are derived by relating the…

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

Recently, Agievich proposed an interesting upper bound on binomial coefficients in the de Moivre-Laplace form. In this article, we show that the latter bound, in the specific case of a central binomial coefficient, is larger than the one…

In this note, we consider asymptotic products of binomial and multinomial coefficients and determine their asymptotic constants and formulas. Among them, special cases are the central binomial coefficients, the related Catalan numbers, and…

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…

We define the deformed $(s,t)$-binomial formula and the deformed Newton $(s,t)$-binomial series, and we will use it to establish the generating functions of the generalized central binomial coefficients and the generalized Catalan numbers.

We find various series that involves the central binomial coefficients $\binom{2n}{n}$, harmonic numbers and Fibonacci Numbers.\\ Contrary to the traditional hypergeometric function $_pF_q$ approach, our method utilizes a straightforward…

For any two arithmetic functions $f,g$ let $\bullet$ be the commutative and associative arithmetic convolution $(f\bullet g)(k):=\sum_{m=0}^k \left( \begin{array}{c} k m \end{array} \right)f(m)g(k-m)$ and for any $n\in\mathbb{N},$…

For $n\ge 3$ let $f(n)$ be the least positive integer $k$ such that $\binom nk>\frac{2^n}{n+1}$. In this paper we investigate the properties of $f(n)$.

For $n=0,1,2,\ldots$ let $W_n=\sum_{k=0}^{[n/3]}\binom{2k}k \binom{3k}k\binom n{3k}(-3)^{n-3k}$, where $[x]$ is the greatest integer not exceeding $x$. Then $\{W_n\}$ is an Ap\'ery-like sequence. In this paper we deduce many congruences…

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

We provide a way to modify and to extend a previously established inequality by P. Erd\H{o}s, R. Graham and others and to answer a conjecture posed in the nineties by R. Graham, which bears on the lack of divisibility of the central…

The purpose of this paper is to identify all of the Cayley-Dickson doubling products. A Cayley-Dickson algebra $\mathbb{A}_{N+1}$ of dimension $2^{N+1}$ consists of all ordered pairs of elements of a Cayley-Dickson algebra $\mathbb{A}_{N}$…