English
Related papers

Related papers: New proofs of some theorems for binomial transform…

200 papers

In a previous paper arXiv:2406.06294 [math.NT], the author proved the exact formulae for ranks of partitions modulo each prime $p\geq 5$. In this paper, for $p=5$ and $7$, we prove special vanishing properties of the Kloosterman sums…

Number Theory · Mathematics 2025-03-13 Qihang Sun

Let $\overline{p}_{j,k}(n)$ denotes the number of $(j,k)$-regular overpartitions of a positive integer $n$ such that none of the parts is congruent to $j$ modulo $k$. Naika et. al. (2021) proved infinite families of congruences modulo…

Number Theory · Mathematics 2021-09-16 Riyajur Rahman , Nipen Saikia

In 2017, motivated by a supercongruence conjectured by Kimoto and Wakayama and confirmed by Long, Osburn and Swisher, Z.-W. Sun introduced the sequence of polynomials: $$…

Number Theory · Mathematics 2025-06-24 Chen Wang , Sheng-Jie Wang

We use properties of modular forms to prove the following extension of the Ramanujan-Mordell formula, \begin{align*} z^{k-j}z_p^{j}=&\frac{p_{\chi}^{k-j}-1}{p_{\chi}^{k}-1}F_p(k,j;\tau)+…

Number Theory · Mathematics 2018-08-06 Zafer Selcuk Aygin

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…

General Mathematics · Mathematics 2021-09-01 Rajeev Kumar

Let $p(n)$ denote the partition function and define $p(n,k)=\sum_{j=0}^{k}\binom{n-j}{k-j}p(j)$ where $p(0)=1$. We prove that $p(n,k)$ is unimodal and satisfies $p(n,k) < \frac{2.825}{\sqrt{n}}\, 2^n $ for fixed $n\ge 1$ and all $1\le k\le…

Number Theory · Mathematics 2026-01-15 Dietrich Burde

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} Z(p^{r})\equiv-2p^{r-1}B_{p-3} ~(\bmod ~ p^{r}), \end{equation*} where $…

Number Theory · Mathematics 2016-11-29 Tianxin Cai , Zhongyan Shen , Lirui Jia

Let $\Bbb Z$ be the set of integers, and let $(m,n)$ be the greatest common divisor of integers $m$ and $n$. Let $p\equiv 1\mod 4$ be a prime, $q\in\Bbb Z$, $2\nmid q$ and $p=c^2+d^2=x^2+qy^2$ with $c,d,x,y\in\Bbb Z$ and $c\e 1\mod 4$.…

Number Theory · Mathematics 2012-09-24 Zhi-Hong Sun

Given a prime $p$ and a positive integer $k$, let $\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z})$ be the ring of $n \times n$ matrices over $\mathbb{Z}/p^{k}\mathbb{Z}$. We consider the number of solutions $X \in…

Combinatorics · Mathematics 2023-01-10 Gilyoung Cheong , Yunqi Liang , Michael Strand

Let $p$ be an odd prime and let $n$ be a positive integer. For any positive integer $\alpha$ and $m\in\{1,2,3\}$, we have \begin{align*}…

Number Theory · Mathematics 2018-10-23 Yong Zhang , Hao Pan

Let $p>5$ be a prime. Motivated by the known formulae $\sum_{k=1}^\infty(-1)^k/(k^3\binom{2k}{k})=-2\zeta(3)/5$ and $\sum_{k=0}^\infty \binom{2k}{k}^2/((2k+1)16^k)=4G/\pi$$ (where $G=\sum_{k=0}^\infty(-1)^k/(2k+1)^2$ is the Catalan…

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

It is widely believed that the parity of the partition function $p(n)$ is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free…

Number Theory · Mathematics 2022-12-15 Ken Ono

Let $M_n$ and $T_n$ denote the $n$th Motzkin number and the $n$th central trinomial coefficient respectively. We prove that for any prime $p\ge 5$, \begin{align*} &\sum_{k=0}^{p-1}M_k^2\equiv…

Number Theory · Mathematics 2022-08-23 Ji-Cai Liu

The numbers $R_n$ and $W_n$ are defined as \begin{align*} R_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{1}{2k-1},\ \text{and}\ W_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{3}{2k-3}. \end{align*} We prove that, for any positive…

Number Theory · Mathematics 2015-01-06 Victor J. W. Guo , Ji-Cai Liu

Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let $p>3$ be a prime. We show that $$T_{p-1}\equiv\left(\frac p3\right)3^{p-1}\ \pmod{p^2},$$ where the central trinomial coefficient $T_n$ is…

Number Theory · Mathematics 2015-04-28 Hui-Qin Cao , Zhi-Wei Sun

We consider Weil sums of binomials of the form $W_{F,d}(a)=\sum_{x \in F} \psi(x^d-a x)$, where $F$ is a finite field, $\psi\colon F\to {\mathbb C}$ is the canonical additive character, $\gcd(d,|F^\times|)=1$, and $a \in F^\times$. If we…

Number Theory · Mathematics 2015-03-18 Daniel J. Katz , Philippe Langevin

We start with new convolution formulas for $F_n - n^p$ involving only the binomial coefficients. Then, we use those to find direct formulas for the sums $\sum_{i=1}^n i^p F_{n-i}$ and $\sum_{i=1}^n i^p F_i$, and we show how our formulas…

Number Theory · Mathematics 2022-12-02 Gregory Dresden

We prove that if $q$ is a power of a prime $p$ and $p^k$ divides $a$, with $k\ge 0$, then \[ 1+(q-1)\sum_{0\le b(q-1)<a} \binom{a}{b(q-1)}\equiv 0\pmod{p^{k+1}}. \] The special case of this congruence where $q=p$ was proved by Carlitz in…

Number Theory · Mathematics 2007-05-23 Sandro Mattarei

Let $p>3$ be a prime, and let $m$ be an integer with $p\nmid m$. In the paper, by using the work of Ishii and Deuring's theorem for elliptic curves with complex multiplication we solve some conjectures of Zhi-Wei Sun concerning…

Number Theory · Mathematics 2011-04-19 Zhi-Hong Sun

Several years ago the second author playing with different "recognizers of real constants", e.g., the LLL algorithm, the Plouffe inverter, etc. found empirically the following formula. Let $p_n/q_n$ denote the $n$th convergent of the…

Number Theory · Mathematics 2014-08-14 Jean-Paul Allouche , Thomas Baruchel