English
Related papers

Related papers: Congruences concerning Legendre polynomials III

200 papers

Let $p$ be an odd prime and let $d\in\{2,3,7\}$. When $(\frac{-d}p)=1$ we can write $p=x^2+dy^2$ with $x,y\in\mathbb Z$; in this paper we aim at determining $x$ or $y$ modulo $p^2$. For example, when $p=x^2+3y^2$, we show that if $p\equiv…

Number Theory · Mathematics 2015-06-09 Zhi-Wei Sun

In this paper we mainly employ the Zeilberger algorithm to study congruences for sums of terms involving products of three binomial coefficients. Let $p>3$ be a prime. We prove that…

Number Theory · Mathematics 2014-04-29 Zhi-Wei Sun

Let $N$ denotes a sufficiently large even integer, $p$ denotes a prime and $P_{r}$ denotes an integer with at most $r$ prime factors. In this paper, we study the solutions of the equation $N-p=P_3$ and consider two special cases where $p$…

General Mathematics · Mathematics 2024-03-18 Runbo Li

For $f : \mathbb{N} \to \{0,\pm 1\}$ the $f$-signed partition numbers $\mathfrak{p}(n,f)$ are defined to be the weighted partition sums \[ \mathfrak{p}(n,f) = \sum_{\substack{x_{1}+\cdots+x_{k} = n \\ x_{1} \geq \cdots \geq x_{k} > 0 \\ k…

Number Theory · Mathematics 2026-03-04 Taylor Daniels

It is shown that for any prime $p$ and any natural numbers $\ell, m,$ and $s$ such that $0<s<p$, the three following congruences \begin{align*}\sum_{i\ge \ell+1}(-1)^{m-i} {m \choose i}{m+s-1+i(p-1) \choose m+s-1+\ell(p-1)} &\equiv 0 \bmod…

Number Theory · Mathematics 2020-08-04 René Gy

In this paper, we confirm several conjectures posed by Sun recently; for example, we prove that for any odd prime $p$ we have $$ \sum_{k=0}^{p-1}A_k\equiv\begin{cases}4x^2-2p\pmod{p^2}\quad&\text{if $p=x^2+2y^2\ (x,y\in\mathbb{Z})$},\\…

Number Theory · Mathematics 2019-10-22 Chen Wang , Zhi-Wei Sun

We present some congruences modulo $p^{6-d}$ for sums of the type $\sum_{k=0}^{(p-3)/2}x^k{2k\choose k}/(2k+1)^d$, for $d=1,2,3$ where $p>5$ is a prime.

Number Theory · Mathematics 2011-11-01 Roberto Tauraso

We continue to investigate binary sequence $(f_u)$ over $\{0,1\}$ defined by $(-1)^{f_u}=\left(\frac{(u^w-u^{wp})/p}{p}\right)$ for integers $u\ge 0$, where $\left(\frac{\cdot}{p}\right)$ is the Legendre symbol and we restrict…

Cryptography and Security · Computer Science 2018-10-05 Zhixiong Chen

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

Number Theory · Mathematics 2024-01-24 Kiran Kedlaya , Swastik Kopparty

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…

Number Theory · Mathematics 2026-01-01 Yassine Otmani , Hacene Belbachir

For any $n\in\mathbb{N}=\{0,1,2,\ldots\}$ and $b,c\in\mathbb{Z}$, the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Let $p$ be an odd prime. In this paper, we…

Number Theory · Mathematics 2020-12-09 Jia-Yu Chen , Chen Wang

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

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…

Number Theory · Mathematics 2016-06-24 Fan Ge , Zhi-Wei Sun

In this paper, we mainly prove two congruence conjecture of Z.-W. Sun. Let $p\equiv3\pmod 4$ be a prime. Then $$\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{8^k}\equiv-\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{(-16)^k}\pmod{p^3}.$$ And for any odd prime…

Number Theory · Mathematics 2023-04-11 Guo-Shuai Mao

In recent years, the congruence $$ \sum_{\substack{i+j+k=p\\ i,j,k>0}} \frac1{ijk} \equiv -2 B_{p-3} \pmod{p}, $$ first discovered by the last author have been generalized by either increasing the number of indices and considering the…

Number Theory · Mathematics 2021-01-22 Megan McCoy , Kevin Thielen , Liuquan Wang , Jianqiang Zhao

In this paper we establish some new supercongruences motivated by the well-known fact $\lim_{n\to\infty}(1+1/n)^n=e$. Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{-1/(p+1)}k^{p+1}\equiv 0\ \pmod{p^5}\ \ \ \mbox{and}\ \ \…

Number Theory · Mathematics 2015-02-27 Zhi-Wei Sun

Let $p$ be a prime, and let $n>0$ and $r$ be integers. In this paper we study Fleck's quotient $$F_p(n,r)=(-p)^{-\lfloor(n-1)/(p-1)\rfloor} \sum_{k=r(mod p)}\binom {n}{k}(-1)^k\in Z.$$ We determine $F_p(n,r)$ mod $p$ completely by certain…

Number Theory · Mathematics 2015-06-26 Zhi-Wei Sun , Daqing Wan

Let $p$ be a prime and ${\mathcal{P}_{p}}$ the set of positive integers which are prime to $p$. We establish the following interesting congruence \[\sum\limits_{\begin{smallmatrix} i+j+k={{p}^{r}} i,j,k\in {\mathcal{P}_{p}}…

Number Theory · Mathematics 2014-07-23 Liuquan Wang

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

Number Theory · Mathematics 2013-04-18 Zhi-Wei Sun

The harmonic numbers $H_n=\sum_{0<k\le n}1/k\ (n=0,1,2,\ldots)$ play important roles in mathematics. Let $p>3$ be a prime. With helps of some combinatorial identities, we establish the following two new congruences:…

Number Theory · Mathematics 2016-02-25 Guo-Shuai Mao , Zhi-Wei Sun