English
Related papers

Related papers: Supercongruences for central trinomial coefficient…

200 papers

It is significant to study congruences involving multiple harmonic sums. Let $p$ be an odd prime, in recent years, the following curious congruence $$\sum_{\substack{i+j+k=p \\ i, j, k>0}} \frac{1}{i j k} \equiv-2 B_{p-3}\pmod p$$ has been…

Number Theory · Mathematics 2023-05-16 Rong Ma , Ni Li

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…

Number Theory · Mathematics 2009-12-14 Zhi-Wei Sun

Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{2k}{k}/2^k=(-1)^{(p-1)/2}-p^2E_{p-3} (mod p^3),$$ $$\sum_{k=1}^{(p-1)/2}\binom{2k}{k}/k=(-1)^{(p+1)/2}8/3*pE_{p-3} (mod p^2),$$…

Number Theory · Mathematics 2015-05-18 Zhi-Wei Sun

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

Number Theory · Mathematics 2023-01-09 Ernie Croot , Hamed Mousavi , Maxie Schmidt

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

Number Theory · Mathematics 2018-04-25 Olivier Bordellès , Florian Luca , Pieter Moree , Igor E. Shparlinski

A ternary inclusion-exclusion polynomial is a polynomial of the form \[ Q_{{p,q,r}}=\frac{(z^{pqr}-1)(z^p-1)(z^q-1)(z^r-1)} {(z^{pq}-1)(z^{qr}-1)(z^{rp}-1)(z-1)}, \] where $p$, $q$, and $r$ are integers $\ge3$ and relatively prime in pairs.…

Number Theory · Mathematics 2010-06-04 Gennady Bachman , Pieter Moree

The central Delannoy numbers $D_n=\sum_{k=0}^{n}\binom{n}{k}\binom{n+k}{k}$ and the little Schr\"oder number $s_n=\sum_{k=1}^{n}\frac{1}{n}\binom{n}{k}\binom{n}{k-1}2^{n-k}$ are important quantities. In this paper, we confirm…

Number Theory · Mathematics 2024-10-24 Chen-Bo Jia , Jia-Qing Huang

For $A,B\in\mathbb Z$, the Lucas sequence $u_n(A,B)\ (n=0,1,2,\ldots)$ are defined by $u_0(A,B)=0$, $u_1(A,B)=1$, and $u_{n+1}(A,B) = Au_n(A,B)-Bu_{n-1}(A,B)$ $(n=1,2,3,\ldots).$ For any odd prime $p$ and positive integer $n$, we establish…

Number Theory · Mathematics 2020-12-15 Zhi-Wei Sun

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

Number Theory · Mathematics 2025-08-12 Soumya Bhattacharya , Habibur Rahaman

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

Number Theory · Mathematics 2013-10-09 Sandro Mattarei , Roberto Tauraso

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

Combinatorics · Mathematics 2014-12-04 Jiyou Li

Let $p>3$ be a prime and let $a$ be a positive integer. We show that if $p\equiv1\pmod 4$ or $a>1$ then $$\sum_{k=0}^{\lfloor\frac34p^a\rfloor}\frac{\binom{2k}k^2}{16^k}\equiv\l(\frac{-1}{p^a}\r)\pmod{p^3}$$ with $(-)$ the Jacobi symbol,…

Number Theory · Mathematics 2018-09-25 Guo-Shuai Mao , Zhi-Wei Sun

Define $g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$ for $n=0,1,2,...$. Those numbers $g_n=g_n(1)$ are closely related to Ap\'ery numbers and Franel numbers. In this paper we establish some fundamental congruences involving $g_n(x)$. For…

Number Theory · Mathematics 2016-07-20 Zhi-Wei Sun

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

Number Theory · Mathematics 2019-02-14 Marcin Mazur , Bogdan V. Petrenko

We present a new formula for the highest power of $a+b$ that divides the sum $B(n,m,a,b)=\sum_{k=0}^{n}\binom{n}{k}^m a^{n-k}b^k$ for the case $m=2$. By using this formula, we give complete 3-adic valuation for central Dellanoy numbers.…

Number Theory · Mathematics 2023-11-27 Jovan Mikić

Let $m$ and $n>0$ be integers. Suppose that $p$ is a prime dividing $m-4$ but not dividing $m$. We show that $\nu_p(\sum_{k=0}^{n-1}\frac{\binom{2k}k}{m^k})$ and $\nu_p(\sum_{k=0}^{n-1}\binom{n-1}{k}(-1)^k\frac{\binom{2k}k}{m^k})$ are at…

Number Theory · Mathematics 2011-04-14 Zhi-Wei Sun

It is shown how to obtain an asymptotic expansion of the generalised central trinomial coefficient $[x^n](x^2 + bx + c)^n$ by means of singularity analysis, thus proving a conjecture of Zhi-Wei Sun.

Number Theory · Mathematics 2012-07-03 Stephan Wagner

If p is a prime and n a positive integer, let v(n) denote the exponent of p in n, and u(n)=n/p^{v(n)} the unit part of n. If k is a positive integer not divisible by p, we show that the p-adic limit of (-1)^{pke} u((kp^e)!) as e goes to…

Number Theory · Mathematics 2013-01-29 Donald M. Davis

Let $p$ be a prime and ${\mathfrak P}_p$ the set of positive integers which are prime to $p$. Recently, Wang and Cai proved that for every positive integer $r$ and prime $p>2$ $$ \sum_{\substack{i+j+k=p^r\\ i,j,k\in{\mathfrak P}_p}}…

Number Theory · Mathematics 2018-04-06 Jianqiang Zhao

Let $p$ be an odd prime. Define the Gaussian power sum \[ G_n(p)=\sum_{a=1}^{p-1}\sum_{b=1}^{p-1}(a+bi)^n\in\mathbb Z[i]. \] We determine $G_p(p)$ modulo high powers of $p$: if $p\equiv 1\pmod 4$ then $$G_p(p)\equiv p^2(1+i)\pmod{p^3},$$…

General Mathematics · Mathematics 2026-02-04 Nikita Kalinin , Faith Shadow Zottor