Related papers: The p-adic valuation of k-central binomial coeffic…

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

We continue to investigate combinatorial properties of functions $f_m$ and $c_m$ considered in our previous papers. They depend on an initial arithmetic function $f_0$. In this paper, the values of $f_0$ are the binomial coefficients. We…

The pentagonal numbers are the integers given by $p_5(n)=n(3n-1)/2\ (n=0,1,2,\ldots)$. Let $(b,c,d)$ be one of the triples $(1,1,2),(1,2,3),(1,2,6)$ and $(2,3,4)$. We show that each $n=0,1,2,\ldots$ can be written as $w+bx+cy+dz$ with…

We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For \rho=1 or -1, we determine $\prod_{0<c<d, (d/c)=\rho} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the…

It is shown how some of the recent results of de Souza et al. [1] can be generalized to describe Hamiltonians whose eigenvalues are given as k-generalized Fibonacci numbers. Here k is an arbitrary integer and the cases considered by de…

We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…

The Motzkin numbers $M_n=\sum_{k=0}^n\binom n{2k}\binom{2k}k/(k+1)$ $(n=0,1,2,\ldots)$ and the central trinomial coefficients $T_n$ ($n=0,1,2,\ldots)$ given by the constant term of $(1+x+x^{-1})^n$, have many combinatorial interpretations.…

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

For given integers a,b, and j at least 1 we determine the set of integers n for which a^n-b^n is divisible by n^j. For j=1,2, this set is usually infinite; we find explicitly the exceptional cases for which a,b the set is finite. For j=2,…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of…

We investigate some classes of infinite series involving central binomial coefficients, particularly focusing on those arising from ratios such as $\binom{2n}{n}\binom{4n}{2n}^{-1}$,$\binom{4n}{2n}\binom{2n}{n}^{-1}$ and related…

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

In this paper we obtain some congruences involving central binomial coefficients and Lucas sequences. For example, we show that if p>5 is a prime then $\sum_{k=0}^{p-1}F_k*binom(2k,k)/12^k$ is congruent to 0,1,-1 modulo p according as p=1,4…

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…

The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized…