English
Related papers

Related papers: Divisibility of some binomial sums

200 papers

In this work we consider the congruence $\sum_{j=1}^{n-1} j^{k(n-1)} \equiv -1 \pmod n$ for each $k \in \mathbb{N}$, thus extending Giuga's ideas for $k=1$. In particular, it is proved that a pair $(n,k)\in \mathbb{N}^2$ satisfies this…

Number Theory · Mathematics 2013-11-15 Antonio M. Oller-Marcén , José María Grau

In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…

Number Theory · Mathematics 2025-10-14 Hui-Li Han , Chen Wang

In this paper, we introduce the power-partible reduction for holonomic (or, P-recursive) sequences and apply it to obtain a series of congruences for Ap\'ery numbers $A_k$. In particular, we prove that, for any $r\in\mathbb{N}$, there…

Combinatorics · Mathematics 2024-07-16 Rong-Hua Wang , Michael X. X. Zhong

We represent the sums $\sum_{k=0}^{n-1}{n \choose k}^{-2}$, $\sum_{k=0}^m{m\choose k}^{-1}{a\choose n-k}^{-1}$, $\sum_{k=0}^{n-1}\frac{q^{-k(k-1)}}{{\genfrac{[}{]}{0pt}{}{n}{k}}_q}$, and the sum of the reciprocals of the summands in Dixon's…

Combinatorics · Mathematics 2009-09-12 Moa Apagodu , Doron Zeilberger

Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values…

Number Theory · Mathematics 2022-02-01 Sai Teja Somu , Vidyanshu Mishra

For a positive integer $n$ let $H_n=\sum_{k=1}^{n}1/k$ be the $n$th harmonic number. Z. W. Sun conjectured that for any prime $p\ge 5$, $$ \sum_{k=1}^{p-1}\frac{H_k}{k\cdot 2^k} \equiv7/24pB_{p-3}\pmod{p^2}. $$ This conjecture is recently…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…

Number Theory · Mathematics 2025-08-06 Laura De Carli , Maurizio Laporta

We give some results and conjectures about recurrence relations for certain sequences of binomial sums.

Combinatorics · Mathematics 2007-05-23 Johann Cigler

By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

In this paper we establish a $q$-analogue of a congruence of Sun concerning the products of binomial coefficients modulo the square of a prime.

Combinatorics · Mathematics 2007-05-23 Hao Pan , Hui-Qin Cao

Inspired by the recent work by Nadji, Ahmia and Ram\'irez, we examined the arithmetic properties of $\bar{B}_{l_1,l_2} (n)$, the number of overpartitions of n whose parts are neither divisible by $l_1$ nor divisible by $l_2$. In particular,…

Number Theory · Mathematics 2025-07-04 Anakha V

In this article, we study necessary conditions for certain square-free integers to be congruent numbers. Our method uses divisibility properties of class numbers of related imaginary quadratic fields. We first consider positive square-free…

Number Theory · Mathematics 2026-04-28 Shamik Das , Debajyoti De , Sudipa Mondal

We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.

Probability · Mathematics 2016-06-14 Jonathon Peterson

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

Formal Languages and Automata Theory · Computer Science 2016-07-07 Prateek Karandikar , Manfred Kufleitner , Philippe Schnoebelen

The following result gives the flavor of this paper: Let $t$, $k$ and $q$ be integers such that $q\geq 0$, $0\leq t < k$ and $t \equiv k \,({\rm mod}\, 2)$, and let $s\in [0,t+1]$ be the unique integer satisfying $s \equiv q +…

Combinatorics · Mathematics 2016-12-21 Yair Caro , Adriana Hansberg , Amanda Montejano

Let $p$ be an odd prime and let $a,m$ be integers with $a>0$ and $m \not\equiv0\pmod p$. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ mod $p^2$ for $d=0,1$; for example,…

Number Theory · Mathematics 2016-02-16 Zhi-Wei Sun

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…

Number Theory · Mathematics 2023-09-04 Zubeyir Cinkir , Aysegul Ozturkalan

Let $p$ be an odd prime. In 2008 E. Mortenson proved van Hamme's following conjecture: $$\sum_{k=0}^{(p-1)/2}(4k+1)\binom{-1/2}k^3\equiv (-1)^{(p-1)/2}p\pmod{p^3}.$$ In this paper we show further that…

Number Theory · Mathematics 2014-02-19 Zhi-Wei Sun

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

General Mathematics · Mathematics 2024-11-20 Eteri Samsonadze

In this paper, we present an algorithm which allows us to search for all the bisections for the binomial coefficients $\{\binom{n}{k} \}_{k=0,...,n}$ and include a table with the results for all $n\le 154$. Connections with previous work on…

Combinatorics · Mathematics 2018-03-28 Eugen J. Ionascu