中文
相关论文

相关论文: Three supercongruences for Apery numbers or Franel…

200 篇论文

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

组合数学 · 数学 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

For $m=3,4,\ldots$ those $p_m(x)=(m-2)x(x-1)/2+x$ with $x\in\mathbb Z$ are called generalized $m$-gonal numbers. Sun [13] studied for what values of positive integers $a,b,c$ the sum $ap_5+bp_5+cp_5$ is universal over $\mathbb Z$ (i.e., any…

数论 · 数学 2016-06-24 Fan Ge , Zhi-Wei Sun

A prime number $p$ is said to be a Wolstenholme prime if it satisfies the congruence ${2p-1\choose p-1} \equiv 1 \,\,(\bmod{\,\,p^4})$. For such a prime $p$, we establish the expression for ${2p-1\choose p-1}\,\,(\bmod{\,\,p^8})$ given in…

数论 · 数学 2018-04-10 Romeo Mestrovic

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…

数论 · 数学 2026-02-11 Zhi-Wei Sun

We show that for any prime prime $p\not=2$ $$\sum_{k=1}^{p-1} {(-1)^k\over k}{-{1\over 2} \choose k} \equiv -\sum_{k=1}^{(p-1)/2}{1\over k} \pmod{p^3}$$ by expressing the l.h.s. as a combination of alternating multiple harmonic sums.

数论 · 数学 2009-12-25 Roberto Tauraso

Let $n$ and $r$ be positive integers. Define the numbers $S_n^{(r)}$ by $S_n^{(r)}=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}{k}(2k+1)^r.$ In this paper we prove some conjectures of Guo and Liu which extend some conjectures of Z.-W. Sun…

数论 · 数学 2019-01-28 Guo-Shuai Mao

By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…

数论 · 数学 2019-02-14 Victor J. W. Guo , Wadim Zudilin

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…

数论 · 数学 2009-12-14 Zhi-Wei Sun

Let ${{\overline{p}}_{3}}(n)$ be the number of overpartition triples of $n$. By elementary series manipulations, we establish some congruences for ${\overline{p}}_{3}(n)$ modulo small powers of 2, such as…

数论 · 数学 2015-05-13 Liuquan Wang

Let a tribonacci sequence be a sequence of integers satisfying $a_k=a_{k-1}+a_{k-2}+a_{k-3}$ for all $k\ge 4$. For any positive integers $k$ and $n$, denote by $f_k(n)$ the number of tribonacci sequences with $a_1, a_2, a_3>0$ and with…

数论 · 数学 2023-01-31 Luke Pebody

In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…

组合数学 · 数学 2016-06-30 Roberto Tauraso

Let $ p \ge 5 $ be a prime and let $ b, c \in \mathbb{Z} $. Denote by $ T_k(b,c) $ the generalized central trinomial coefficient, i.e., the coefficient of $ x^k $ in $ (x^2 + bx + c)^k $. In this paper, we establish congruences modulo $ p^3…

数论 · 数学 2026-01-01 Yassine Otmani , Hacene Belbachir

In this paper, we study congruences on sums of products of binomial coefficients that can be proved by using properties of the Jacobi polynomials. We give special attention to polynomial congruences containing Catalan numbers, second-order…

The n-th Delannoy number and the n-th Schr\"oder number given by $D_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}$ and $S_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}/(k+1)$ respectively arise naturally from enumerative combinatorics. Let p be an…

数论 · 数学 2011-08-23 Zhi-Wei Sun

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…

数论 · 数学 2013-01-22 Victor J. W. Guo

Let $p>3$ be a prime, $a_1,a_2,a_3\in\Bbb Z$ and let $N_p(x^3+a_1x^2+a_2x+a_3)$ denote the number of solutions to the congruence $x^3+a_1x^2+a_2x+a_3\equiv 0\pmod p$. In this paper, we give an explicit criterion for…

数论 · 数学 2025-04-02 Zhi-Hong Sun

Recently, Z. W. Sun introduced a sequence $(S_n)_{n\geq 0}$, where $S_n=\frac{\binom{6n}{3n} \binom{3n}{n}}{2(2n+1)\binom{2n}{n}}$, and found one congruence and two convergent series on $S_n$ by {\tt{Mathematica}}. Furthermore, he proposed…

组合数学 · 数学 2016-06-28 Brian Y. Sun , J. X. Meng

We find new representations, in terms of constant terms of powers of Laurent polynomials, for all the 15 sporadic Ap{\'e}ry-like sequences discovered by Zagier, Almkvist-Zudilin and Cooper. The new representations lead to binomial…

数论 · 数学 2025-01-07 Ofir Gorodetsky

We prove that, if $m,n\geqslant 1$ and $a_1,\ldots,a_m$ are nonnegative integers, then \begin{align*} \frac{[a_1+\cdots+a_m+1]!}{[a_1]!\ldots[a_m]!}\sum^{n-1}_{h=0}q^h\prod_{i=1}^m{h\brack a_i} \equiv 0\pmod{[n]}, \end{align*} where…

数论 · 数学 2015-04-22 Victor J. W. Guo , Ji-Cai Liu

Recently, Z.-W. Sun made the following conjecture: for any odd prime $p$ and odd integer $m$, $$ \frac{1}{m^2{m-1\choose (m-1)/2}}\Bigg(\sum_{k=0}^{(pm-1)/2}\frac{{2k\choose k}}{8^k}…

数论 · 数学 2019-12-18 Victor J. W. Guo