English
Related papers

Related papers: On some divisibility properties of binomial sums

200 papers

For a fixed $z\in\mathbb{C}$ and a fixed $k\in\mathbb{N}$, let $\sigma_{z}^{(k)}(n)$ denote the sum of $z$-th powers of those divisors $d$ of $n$ whose $k$-th powers also divide $n$. This arithmetic function is a simultaneous generalization…

Number Theory · Mathematics 2025-09-01 Atul Dixit , Bibekananda Maji , Akshaa Vatwani

Let $p$ be an odd prime. In the paper, by using the properties of Legendre polynomials we prove some congruences for $\sum_{k=0}^{\frac{p-1}2}\binom{2k}k^2m^{-k}\mod {p^2}$. In particular, we confirm several conjectures of Z.W. Sun. We also…

Number Theory · Mathematics 2010-12-20 Zhi-Hong Sun

In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…

Number Theory · Mathematics 2026-02-11 Zhi-Wei Sun

In 1920, P. A. MacMahon generalized the (classical) notion of divisor sums by relating it to the theory of partitions of integers. In this paper, we extend the idea of MacMahon. In doing so we reveal a wealth of divisibility theorems and…

Combinatorics · Mathematics 2023-09-07 Tewodros Amdeberhan , George E. Andrews , Roberto Tauraso

The polynomials $d_n(x)$ are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime $p$, the following congruences hold modulo $p$: \begin{align*}…

Number Theory · Mathematics 2016-04-19 Song Guo , Victor J. W. Guo

Francis Castro, et al [2] computed the exact divisibility of families of exponential sums associated to binomials $F(X) = aX^{d_1} + bX^{d_2}$ over $\mathbb{F}_p$, and a conjecture is presented for related work. Here we study this question.

Number Theory · Mathematics 2019-06-18 Xiaogang Liu

It is well known that for all $n\geq1$ the number $n+ 1$ is a divisor of the central binomial coefficient ${2n\choose n}$. Since the $n$th central binomial coefficient equals the number of lattice paths from $(0,0)$ to $(n,n)$ by unit steps…

Combinatorics · Mathematics 2021-04-13 Matthew Just , Maxwell Schneider

Let $\{f_n\}$ be the Franel numbers given by $f_n=\sum_{k=0}^n\binom nk^3$, and let $p>5$ be a prime. In this paper we mainly determine $\sum_{k=0}^{p-1} \binom{2k}k\frac{f_k}{m^k}\pmod p$ for $m=5,-16,16,32,-49,50,96$. Let…

Number Theory · Mathematics 2015-05-05 Zhi-Hong Sun

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…

Number Theory · Mathematics 2015-06-26 Victor J. W. Guo , Frederic Jouhet , Jiang Zeng

Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…

Number Theory · Mathematics 2019-03-01 Lee Troupe

We find the joint distribution of three simple statistics on lattice paths of n upsteps and n downsteps leading to a triple sum identity for the central binomial coefficient {2n}-choose-{n}. We explain why one of the constituent double sums…

Combinatorics · Mathematics 2012-06-15 David Callan

Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…

Number Theory · Mathematics 2024-09-25 Kaimin Cheng , Shuhong Gao

In this paper, we apply the power-partible reduction to study arithmetic properties of sums involving Delannoy numbers $D_k$ and polynomials $D_k(z)$. Let $v\in\bN$ and $p$ be an odd prime. It is proved that, for any…

Combinatorics · Mathematics 2025-05-12 Rong-Hua Wang , Michael X. X. Zhong

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

Number Theory · Mathematics 2011-08-25 Zhi-Hong Sun

Dirichlet's $L$-functions are natural extensions of the Riemann zeta function. In this paper we first give a brief survey of Ap\'ery-like series for some special values of the zeta function and certain $L$-functions. Then, we establish two…

Number Theory · Mathematics 2016-01-13 Zhi-Wei Sun

The summation formula $$ \sum^{n-1}_{i=0}\epsilon^i i! (i^k+u_k) = v_k+\epsilon^{n-1} n! A_{k-1}(n) $$ $(\epsilon=\pm 1; k=1,2,...; u_k, v_k\in \msbm\hbox{Z}; A_{k-1}$ is a polynomial) is derived and its various aspects are considered. In…

Number Theory · Mathematics 2007-05-23 Branko Dragovich

Using elementary methods, we determine the highest power of 2 dividing a power sum 1^n + 2^n + . . . + m^n, generalizing Lengyel's formula for the case where m is itself a power of 2. An application is a simple proof of Moree's result that,…

Number Theory · Mathematics 2012-11-27 Kieren MacMillan , Jonathan Sondow

Let $q=2^n$, $0\leq k\leq n-1$, $n/\gcd(n,k)$ be odd and $k\neq n/3, 2n/3$. In this paper the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\mathrm{Tr}_1^n(\alpha x^{2^{2k}+1}+\beta x^{2^k+1}+\ga…

Information Theory · Computer Science 2009-04-16 Jinquan Luo

We present some simple proofs of the well-known expressions for \[ \zeta(2k) = \sum_{m=1}^\infty \frac{1}{m^{2k}}, \qquad \beta(2k+1) = \sum_{m=0}^\infty \frac{(-1)^m}{(2m+1)^{2k+1}}, \] where $k = 1,2,3,\dots$, in terms of the Bernoulli…

Number Theory · Mathematics 2025-01-03 Óscar Ciaurri , Luis M. Navas , Francisco J. Ruiz , Juan L. Varona

Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form \[S_r(n) = \sum_k \binom{2n}{k}|n-k|^r,\] where $r$ and $n$ are non-negative integers. We consider sums of the form…

Combinatorics · Mathematics 2015-01-28 Richard P. Brent